./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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_5.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 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:18:14,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:18:14,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:18:14,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:18:14,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:18:14,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:18:14,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:18:14,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:18:14,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:18:14,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:18:14,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:18:14,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:18:14,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:18:14,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:18:14,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:18:14,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:18:14,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:18:14,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:18:14,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:18:14,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:18:14,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:18:14,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:18:14,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:18:14,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:18:14,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:18:14,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:18:14,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:18:14,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:18:14,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:18:14,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:18:14,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:18:14,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:18:14,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:18:14,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:18:14,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:18:14,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:18:14,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:18:14,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:18:14,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:18:14,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:18:14,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:18:14,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 21:18:14,771 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:18:14,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:18:14,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:18:14,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:18:14,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:18:14,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:18:14,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:18:14,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:18:14,775 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:18:14,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:18:14,775 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:18:14,775 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:18:14,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:18:14,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:18:14,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:18:14,776 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:18:14,776 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:18:14,776 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:18:14,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:18:14,776 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:18:14,776 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:18:14,776 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:18:14,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:18:14,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:18:14,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:18:14,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:18:14,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:18:14,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:18:14,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 21:18:14,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 21:18:14,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:18:14,779 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 -> 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c [2021-12-18 21:18:15,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:18:15,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:18:15,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:18:15,070 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:18:15,071 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:18:15,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2021-12-18 21:18:15,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4799dc150/c23e73bf70b8413d92f77acb5644ef52/FLAG21c7aa836 [2021-12-18 21:18:15,500 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:18:15,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2021-12-18 21:18:15,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4799dc150/c23e73bf70b8413d92f77acb5644ef52/FLAG21c7aa836 [2021-12-18 21:18:15,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4799dc150/c23e73bf70b8413d92f77acb5644ef52 [2021-12-18 21:18:15,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:18:15,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:18:15,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:18:15,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:18:15,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:18:15,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:18:15" (1/1) ... [2021-12-18 21:18:15,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4310981d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:15, skipping insertion in model container [2021-12-18 21:18:15,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:18:15" (1/1) ... [2021-12-18 21:18:15,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:18:15,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:18:16,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:18:16,143 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-18 21:18:16,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@34dcce33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:16, skipping insertion in model container [2021-12-18 21:18:16,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:18:16,144 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-18 21:18:16,145 INFO L158 Benchmark]: Toolchain (without parser) took 277.01ms. Allocated memory is still 107.0MB. Free memory was 84.8MB in the beginning and 71.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-18 21:18:16,145 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:18:16,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.80ms. Allocated memory is still 107.0MB. Free memory was 84.5MB in the beginning and 71.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-18 21:18:16,148 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.14ms. Allocated memory is still 88.1MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.80ms. Allocated memory is still 107.0MB. Free memory was 84.5MB in the beginning and 71.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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_5.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 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:18:17,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:18:17,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:18:17,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:18:17,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:18:17,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:18:17,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:18:17,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:18:17,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:18:17,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:18:17,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:18:17,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:18:17,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:18:17,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:18:17,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:18:17,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:18:17,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:18:17,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:18:17,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:18:17,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:18:17,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:18:17,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:18:17,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:18:17,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:18:17,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:18:17,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:18:17,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:18:17,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:18:17,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:18:17,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:18:17,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:18:17,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:18:17,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:18:17,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:18:17,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:18:17,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:18:17,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:18:17,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:18:17,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:18:17,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:18:17,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:18:17,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 21:18:17,787 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:18:17,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:18:17,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:18:17,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:18:17,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:18:17,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:18:17,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:18:17,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:18:17,791 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:18:17,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:18:17,791 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:18:17,792 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:18:17,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:18:17,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:18:17,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:18:17,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:18:17,792 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:18:17,792 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:18:17,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:18:17,793 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:18:17,793 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 21:18:17,793 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 21:18:17,793 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:18:17,793 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:18:17,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:18:17,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:18:17,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:18:17,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:18:17,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:18:17,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:18:17,794 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 21:18:17,794 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 21:18:17,795 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:18:17,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 21:18:17,795 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 -> 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c [2021-12-18 21:18:18,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:18:18,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:18:18,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:18:18,114 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:18:18,114 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:18:18,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2021-12-18 21:18:18,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1393f2c/50f320bd25f44def8fde9c1ac363b3df/FLAG1ef576604 [2021-12-18 21:18:18,560 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:18:18,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2021-12-18 21:18:18,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1393f2c/50f320bd25f44def8fde9c1ac363b3df/FLAG1ef576604 [2021-12-18 21:18:18,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1393f2c/50f320bd25f44def8fde9c1ac363b3df [2021-12-18 21:18:18,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:18:18,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:18:18,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:18:18,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:18:18,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:18:18,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:18:18" (1/1) ... [2021-12-18 21:18:18,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a71782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:18, skipping insertion in model container [2021-12-18 21:18:18,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:18:18" (1/1) ... [2021-12-18 21:18:18,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:18:18,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:18:19,263 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:18:19,293 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-18 21:18:19,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:18:19,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:18:19,358 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:18:19,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:18:19,422 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:18:19,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19 WrapperNode [2021-12-18 21:18:19,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:18:19,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:18:19,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:18:19,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:18:19,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,477 INFO L137 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 24, calls inlined = 15, statements flattened = 102 [2021-12-18 21:18:19,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:18:19,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:18:19,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:18:19,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:18:19,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:18:19,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:18:19,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:18:19,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:18:19,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (1/1) ... [2021-12-18 21:18:19,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:18:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:18:19,542 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) [2021-12-18 21:18:19,558 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 [2021-12-18 21:18:19,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 21:18:19,582 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-12-18 21:18:19,583 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-12-18 21:18:19,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 21:18:19,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 21:18:19,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-12-18 21:18:19,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-12-18 21:18:19,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:18:19,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:18:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:18:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:18:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 21:18:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:18:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 21:18:19,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:18:19,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:18:19,697 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:18:19,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:18:20,004 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:18:20,012 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:18:20,013 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-18 21:18:20,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:18:20 BoogieIcfgContainer [2021-12-18 21:18:20,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:18:20,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:18:20,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:18:20,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:18:20,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:18:18" (1/3) ... [2021-12-18 21:18:20,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382c0c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:18:20, skipping insertion in model container [2021-12-18 21:18:20,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:19" (2/3) ... [2021-12-18 21:18:20,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382c0c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:18:20, skipping insertion in model container [2021-12-18 21:18:20,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:18:20" (3/3) ... [2021-12-18 21:18:20,022 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2021-12-18 21:18:20,027 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:18:20,027 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-18 21:18:20,075 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:18:20,089 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 21:18:20,090 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-18 21:18:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 71 states have internal predecessors, (78), 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) [2021-12-18 21:18:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 21:18:20,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:20,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:20,114 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:20,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash -544283271, now seen corresponding path program 1 times [2021-12-18 21:18:20,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:20,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485944572] [2021-12-18 21:18:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:20,130 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:20,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:20,161 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) [2021-12-18 21:18:20,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 21:18:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:20,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:18:20,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:20,335 INFO L388 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 [2021-12-18 21:18:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:20,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:20,391 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:20,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485944572] [2021-12-18 21:18:20,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485944572] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:20,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:20,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:18:20,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202623668] [2021-12-18 21:18:20,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:20,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:18:20,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:20,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:18:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:18:20,423 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 71 states have internal predecessors, (78), 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) [2021-12-18 21:18:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:20,702 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2021-12-18 21:18:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:18:20,704 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 [2021-12-18 21:18:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:20,711 INFO L225 Difference]: With dead ends: 102 [2021-12-18 21:18:20,711 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 21:18:20,713 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:18:20,716 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:20,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 288 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:18:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 21:18:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 81. [2021-12-18 21:18:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 73 states have internal predecessors, (81), 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) [2021-12-18 21:18:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-12-18 21:18:20,749 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 10 [2021-12-18 21:18:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:20,750 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-12-18 21:18:20,750 INFO L471 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) [2021-12-18 21:18:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-12-18 21:18:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 21:18:20,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:20,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:20,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-18 21:18:20,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:20,957 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:20,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash -515654120, now seen corresponding path program 1 times [2021-12-18 21:18:20,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:20,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655124487] [2021-12-18 21:18:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:20,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:20,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:20,966 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) [2021-12-18 21:18:20,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 21:18:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:21,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:18:21,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:21,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:21,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655124487] [2021-12-18 21:18:21,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655124487] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:21,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:21,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:18:21,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096224289] [2021-12-18 21:18:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:21,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:18:21,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:18:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:18:21,096 INFO L87 Difference]: Start difference. First operand 81 states and 90 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) [2021-12-18 21:18:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:21,117 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2021-12-18 21:18:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:18:21,117 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 [2021-12-18 21:18:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:21,118 INFO L225 Difference]: With dead ends: 86 [2021-12-18 21:18:21,119 INFO L226 Difference]: Without dead ends: 86 [2021-12-18 21:18:21,119 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:18:21,120 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:21,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 334 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:18:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-18 21:18:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2021-12-18 21:18:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 71 states have internal predecessors, (78), 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) [2021-12-18 21:18:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2021-12-18 21:18:21,127 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 10 [2021-12-18 21:18:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:21,128 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2021-12-18 21:18:21,128 INFO L471 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) [2021-12-18 21:18:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2021-12-18 21:18:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:18:21,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:21,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:21,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-18 21:18:21,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:21,338 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:21,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash 307087832, now seen corresponding path program 1 times [2021-12-18 21:18:21,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:21,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52395513] [2021-12-18 21:18:21,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:21,339 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:21,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:21,341 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) [2021-12-18 21:18:21,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 21:18:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:21,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 21:18:21,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:21,431 INFO L388 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 [2021-12-18 21:18:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:21,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:21,533 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:21,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52395513] [2021-12-18 21:18:21,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52395513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:21,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:21,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:18:21,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576974551] [2021-12-18 21:18:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:21,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:18:21,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:18:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:18:21,536 INFO L87 Difference]: Start difference. First operand 79 states and 87 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) [2021-12-18 21:18:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:21,763 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2021-12-18 21:18:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:18:21,763 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 [2021-12-18 21:18:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:21,764 INFO L225 Difference]: With dead ends: 92 [2021-12-18 21:18:21,764 INFO L226 Difference]: Without dead ends: 92 [2021-12-18 21:18:21,764 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:18:21,765 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:21,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 359 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:18:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-18 21:18:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2021-12-18 21:18:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-18 21:18:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2021-12-18 21:18:21,770 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 11 [2021-12-18 21:18:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:21,770 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2021-12-18 21:18:21,771 INFO L471 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) [2021-12-18 21:18:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2021-12-18 21:18:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 21:18:21,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:21,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:21,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-18 21:18:21,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:21,978 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash 149796357, now seen corresponding path program 1 times [2021-12-18 21:18:21,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:21,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787356919] [2021-12-18 21:18:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:21,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:21,981 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) [2021-12-18 21:18:21,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 21:18:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:22,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:18:22,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:22,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:22,069 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787356919] [2021-12-18 21:18:22,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787356919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:22,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:22,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:18:22,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932694871] [2021-12-18 21:18:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:22,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:18:22,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:18:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:18:22,071 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:22,086 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2021-12-18 21:18:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:18:22,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-12-18 21:18:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:22,087 INFO L225 Difference]: With dead ends: 85 [2021-12-18 21:18:22,087 INFO L226 Difference]: Without dead ends: 85 [2021-12-18 21:18:22,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:18:22,088 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 20 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:22,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 319 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:18:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-18 21:18:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2021-12-18 21:18:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-18 21:18:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-18 21:18:22,093 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 14 [2021-12-18 21:18:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:22,093 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-18 21:18:22,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-18 21:18:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 21:18:22,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:22,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:22,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:22,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:22,304 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash -46717148, now seen corresponding path program 1 times [2021-12-18 21:18:22,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:22,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059348576] [2021-12-18 21:18:22,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:22,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:22,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:22,309 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) [2021-12-18 21:18:22,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 21:18:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:22,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 21:18:22,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:22,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:22,478 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:22,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059348576] [2021-12-18 21:18:22,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059348576] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:22,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:22,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:18:22,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123697088] [2021-12-18 21:18:22,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:22,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:18:22,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:18:22,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:18:22,481 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:22,525 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-12-18 21:18:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:18:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-12-18 21:18:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:22,526 INFO L225 Difference]: With dead ends: 91 [2021-12-18 21:18:22,526 INFO L226 Difference]: Without dead ends: 91 [2021-12-18 21:18:22,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:18:22,527 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:22,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 393 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:18:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-18 21:18:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2021-12-18 21:18:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 75 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-18 21:18:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-12-18 21:18:22,533 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2021-12-18 21:18:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:22,534 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-12-18 21:18:22,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-12-18 21:18:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 21:18:22,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:22,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:22,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:22,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:22,743 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash -945781721, now seen corresponding path program 1 times [2021-12-18 21:18:22,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:22,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502003608] [2021-12-18 21:18:22,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:22,744 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:22,746 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) [2021-12-18 21:18:22,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 21:18:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:22,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 21:18:22,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:22,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:22,823 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:22,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502003608] [2021-12-18 21:18:22,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502003608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:22,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:22,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:18:22,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012171768] [2021-12-18 21:18:22,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:22,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:18:22,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:18:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:18:22,825 INFO L87 Difference]: Start difference. First operand 84 states and 91 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) [2021-12-18 21:18:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:22,839 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2021-12-18 21:18:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:18:22,840 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 [2021-12-18 21:18:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:22,840 INFO L225 Difference]: With dead ends: 90 [2021-12-18 21:18:22,840 INFO L226 Difference]: Without dead ends: 90 [2021-12-18 21:18:22,840 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:18:22,841 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 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 [2021-12-18 21:18:22,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:18:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-18 21:18:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2021-12-18 21:18:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 76 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-18 21:18:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-12-18 21:18:22,845 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2021-12-18 21:18:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:22,845 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-12-18 21:18:22,846 INFO L471 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) [2021-12-18 21:18:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-12-18 21:18:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:18:22,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:22,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:22,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-18 21:18:23,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:23,053 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash 686278594, now seen corresponding path program 1 times [2021-12-18 21:18:23,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:23,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368926664] [2021-12-18 21:18:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:23,054 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:23,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:23,055 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) [2021-12-18 21:18:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 21:18:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:23,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:18:23,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:23,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:18:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:23,206 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368926664] [2021-12-18 21:18:23,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368926664] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:18:23,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:18:23,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-18 21:18:23,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662417572] [2021-12-18 21:18:23,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:18:23,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:18:23,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:23,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:18:23,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:18:23,208 INFO L87 Difference]: Start difference. First operand 85 states and 92 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) [2021-12-18 21:18:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:23,268 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2021-12-18 21:18:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:18:23,269 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 [2021-12-18 21:18:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:23,269 INFO L225 Difference]: With dead ends: 93 [2021-12-18 21:18:23,269 INFO L226 Difference]: Without dead ends: 93 [2021-12-18 21:18:23,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:18:23,270 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:23,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 387 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:18:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-18 21:18:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2021-12-18 21:18:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.423728813559322) internal successors, (84), 79 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-18 21:18:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2021-12-18 21:18:23,274 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 17 [2021-12-18 21:18:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:23,274 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2021-12-18 21:18:23,274 INFO L471 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) [2021-12-18 21:18:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2021-12-18 21:18:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:18:23,275 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:23,275 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:23,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-18 21:18:23,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:23,482 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1101750465, now seen corresponding path program 1 times [2021-12-18 21:18:23,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:23,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558195045] [2021-12-18 21:18:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:23,483 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:23,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:23,483 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) [2021-12-18 21:18:23,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 21:18:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:23,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 21:18:23,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:23,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:23,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:23,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558195045] [2021-12-18 21:18:23,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558195045] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:23,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:23,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:18:23,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392986470] [2021-12-18 21:18:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:23,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:18:23,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:23,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:18:23,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:18:23,617 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:23,657 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-12-18 21:18:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:18:23,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-12-18 21:18:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:23,663 INFO L225 Difference]: With dead ends: 99 [2021-12-18 21:18:23,663 INFO L226 Difference]: Without dead ends: 99 [2021-12-18 21:18:23,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:18:23,663 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:23,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 401 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:18:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-18 21:18:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2021-12-18 21:18:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 83 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-12-18 21:18:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-12-18 21:18:23,668 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 20 [2021-12-18 21:18:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:23,668 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-12-18 21:18:23,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-12-18 21:18:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:18:23,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:23,669 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:23,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:23,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:23,875 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473369, now seen corresponding path program 2 times [2021-12-18 21:18:23,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:23,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438379484] [2021-12-18 21:18:23,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:18:23,876 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:23,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:23,877 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) [2021-12-18 21:18:23,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 21:18:23,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 21:18:23,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:18:23,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 21:18:23,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:23,941 INFO L388 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 [2021-12-18 21:18:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 21:18:24,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:24,008 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:24,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438379484] [2021-12-18 21:18:24,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438379484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:24,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:24,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:18:24,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252338709] [2021-12-18 21:18:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:24,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:18:24,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:18:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:18:24,010 INFO L87 Difference]: Start difference. First operand 94 states and 101 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) [2021-12-18 21:18:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:24,206 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-12-18 21:18:24,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:18:24,206 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 [2021-12-18 21:18:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:24,207 INFO L225 Difference]: With dead ends: 100 [2021-12-18 21:18:24,207 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 21:18:24,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:18:24,207 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:24,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 377 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:18:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 21:18:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-12-18 21:18:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.380952380952381) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-12-18 21:18:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-12-18 21:18:24,211 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 20 [2021-12-18 21:18:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:24,211 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-12-18 21:18:24,211 INFO L471 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) [2021-12-18 21:18:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-12-18 21:18:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:18:24,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:24,211 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:24,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:24,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:24,419 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473368, now seen corresponding path program 1 times [2021-12-18 21:18:24,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:24,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732950324] [2021-12-18 21:18:24,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:24,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:24,421 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) [2021-12-18 21:18:24,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 21:18:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:24,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:18:24,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:24,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:18:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:24,693 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:24,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732950324] [2021-12-18 21:18:24,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732950324] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:18:24,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:18:24,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-18 21:18:24,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772323270] [2021-12-18 21:18:24,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:18:24,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:18:24,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:18:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:18:24,694 INFO L87 Difference]: Start difference. First operand 93 states and 100 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) [2021-12-18 21:18:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:24,857 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-12-18 21:18:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:18:24,858 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 [2021-12-18 21:18:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:24,858 INFO L225 Difference]: With dead ends: 102 [2021-12-18 21:18:24,858 INFO L226 Difference]: Without dead ends: 102 [2021-12-18 21:18:24,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:18:24,859 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:24,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 563 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:18:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-18 21:18:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2021-12-18 21:18:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 88 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-12-18 21:18:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2021-12-18 21:18:24,862 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 20 [2021-12-18 21:18:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:24,862 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2021-12-18 21:18:24,862 INFO L471 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) [2021-12-18 21:18:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2021-12-18 21:18:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:18:24,862 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:24,862 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:24,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:25,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:25,070 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash -62141083, now seen corresponding path program 1 times [2021-12-18 21:18:25,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:25,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286958077] [2021-12-18 21:18:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:25,071 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:25,072 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) [2021-12-18 21:18:25,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 21:18:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:25,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:18:25,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 21:18:25,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:25,172 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:25,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286958077] [2021-12-18 21:18:25,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286958077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:25,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:25,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:18:25,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60060537] [2021-12-18 21:18:25,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:25,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:18:25,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:18:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:18:25,174 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-12-18 21:18:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:25,245 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-12-18 21:18:25,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:18:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 23 [2021-12-18 21:18:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:25,246 INFO L225 Difference]: With dead ends: 105 [2021-12-18 21:18:25,246 INFO L226 Difference]: Without dead ends: 87 [2021-12-18 21:18:25,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:18:25,246 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:25,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 151 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:18:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-18 21:18:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2021-12-18 21:18:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.396551724137931) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 21:18:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2021-12-18 21:18:25,249 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 23 [2021-12-18 21:18:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:25,249 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2021-12-18 21:18:25,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-12-18 21:18:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2021-12-18 21:18:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 21:18:25,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:25,250 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:25,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:25,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:25,456 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:25,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2043849464, now seen corresponding path program 2 times [2021-12-18 21:18:25,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:25,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474435258] [2021-12-18 21:18:25,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:18:25,457 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:25,458 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) [2021-12-18 21:18:25,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 21:18:25,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 21:18:25,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:18:25,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 21:18:25,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:25,527 INFO L388 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 [2021-12-18 21:18:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-18 21:18:25,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:25,669 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:25,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474435258] [2021-12-18 21:18:25,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474435258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:25,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:25,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:18:25,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883854950] [2021-12-18 21:18:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:25,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:18:25,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:18:25,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:18:25,670 INFO L87 Difference]: Start difference. First operand 83 states and 89 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) [2021-12-18 21:18:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:25,921 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2021-12-18 21:18:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:18:25,922 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 [2021-12-18 21:18:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:25,922 INFO L225 Difference]: With dead ends: 99 [2021-12-18 21:18:25,922 INFO L226 Difference]: Without dead ends: 99 [2021-12-18 21:18:25,922 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:18:25,923 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 48 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:25,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 442 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:18:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-18 21:18:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2021-12-18 21:18:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 75 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 21:18:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-12-18 21:18:25,925 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 26 [2021-12-18 21:18:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:25,925 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-12-18 21:18:25,925 INFO L471 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) [2021-12-18 21:18:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-12-18 21:18:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 21:18:25,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:25,925 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:25,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:26,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:26,132 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:26,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1441027708, now seen corresponding path program 1 times [2021-12-18 21:18:26,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:26,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395914923] [2021-12-18 21:18:26,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:26,133 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:26,134 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) [2021-12-18 21:18:26,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 21:18:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:26,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 21:18:26,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:26,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:18:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:26,738 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:26,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395914923] [2021-12-18 21:18:26,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395914923] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:18:26,738 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:18:26,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-18 21:18:26,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763489501] [2021-12-18 21:18:26,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:18:26,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 21:18:26,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 21:18:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2021-12-18 21:18:26,740 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:27,071 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-12-18 21:18:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 21:18:27,072 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-12-18 21:18:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:27,072 INFO L225 Difference]: With dead ends: 88 [2021-12-18 21:18:27,072 INFO L226 Difference]: Without dead ends: 88 [2021-12-18 21:18:27,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2021-12-18 21:18:27,073 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 32 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:27,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 984 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:18:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-18 21:18:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-18 21:18:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.34375) internal successors, (86), 81 states have internal predecessors, (86), 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) [2021-12-18 21:18:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2021-12-18 21:18:27,075 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 30 [2021-12-18 21:18:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:27,075 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2021-12-18 21:18:27,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2021-12-18 21:18:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:18:27,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:27,076 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:27,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:27,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:27,283 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:27,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107868, now seen corresponding path program 2 times [2021-12-18 21:18:27,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:27,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205018577] [2021-12-18 21:18:27,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:18:27,284 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:27,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:27,285 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) [2021-12-18 21:18:27,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 21:18:27,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 21:18:27,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:18:27,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 21:18:27,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:27,405 INFO L388 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 [2021-12-18 21:18:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:27,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:27,703 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:27,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205018577] [2021-12-18 21:18:27,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205018577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:27,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:27,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:18:27,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775123869] [2021-12-18 21:18:27,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:27,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:18:27,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:18:27,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:18:27,705 INFO L87 Difference]: Start difference. First operand 88 states and 94 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) [2021-12-18 21:18:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:28,088 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-18 21:18:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:18:28,088 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 [2021-12-18 21:18:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:28,089 INFO L225 Difference]: With dead ends: 94 [2021-12-18 21:18:28,089 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 21:18:28,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:18:28,090 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:28,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 443 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:18:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 21:18:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2021-12-18 21:18:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 79 states have internal predecessors, (84), 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) [2021-12-18 21:18:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-18 21:18:28,092 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 36 [2021-12-18 21:18:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:28,092 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-18 21:18:28,092 INFO L471 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) [2021-12-18 21:18:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-18 21:18:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:18:28,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:28,093 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:28,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:28,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:28,300 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107867, now seen corresponding path program 1 times [2021-12-18 21:18:28,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:28,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536796299] [2021-12-18 21:18:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:28,302 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:28,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:28,309 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) [2021-12-18 21:18:28,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 21:18:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:28,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 21:18:28,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:28,463 INFO L388 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 [2021-12-18 21:18:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:28,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:28,621 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:28,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536796299] [2021-12-18 21:18:28,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536796299] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:28,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:28,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:18:28,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130781175] [2021-12-18 21:18:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:28,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:18:28,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:18:28,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:18:28,622 INFO L87 Difference]: Start difference. First operand 86 states and 92 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) [2021-12-18 21:18:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:29,024 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2021-12-18 21:18:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:18:29,024 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 [2021-12-18 21:18:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:29,025 INFO L225 Difference]: With dead ends: 87 [2021-12-18 21:18:29,025 INFO L226 Difference]: Without dead ends: 87 [2021-12-18 21:18:29,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:18:29,025 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:29,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 349 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:18:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-18 21:18:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2021-12-18 21:18:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 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) [2021-12-18 21:18:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2021-12-18 21:18:29,027 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 36 [2021-12-18 21:18:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:29,027 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2021-12-18 21:18:29,027 INFO L471 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) [2021-12-18 21:18:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2021-12-18 21:18:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:18:29,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:29,028 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:18:29,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:29,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:29,236 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash 94582189, now seen corresponding path program 1 times [2021-12-18 21:18:29,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:29,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20358781] [2021-12-18 21:18:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:29,236 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:29,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:29,237 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) [2021-12-18 21:18:29,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 21:18:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:29,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:18:29,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:29,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:29,449 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:29,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20358781] [2021-12-18 21:18:29,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20358781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:29,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:29,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:18:29,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290747927] [2021-12-18 21:18:29,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:29,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:18:29,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:18:29,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:18:29,454 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:29,492 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-12-18 21:18:29,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:18:29,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-12-18 21:18:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:29,494 INFO L225 Difference]: With dead ends: 84 [2021-12-18 21:18:29,494 INFO L226 Difference]: Without dead ends: 84 [2021-12-18 21:18:29,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:18:29,495 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:29,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 307 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:18:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-18 21:18:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-18 21:18:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.265625) internal successors, (81), 77 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 21:18:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-12-18 21:18:29,497 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 36 [2021-12-18 21:18:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:29,497 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-12-18 21:18:29,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-12-18 21:18:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 21:18:29,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:29,497 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:29,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:29,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:29,698 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:29,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2072333273, now seen corresponding path program 1 times [2021-12-18 21:18:29,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:29,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291925647] [2021-12-18 21:18:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:29,699 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:29,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:29,699 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) [2021-12-18 21:18:29,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 21:18:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:29,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:18:29,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:29,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:29,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:29,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291925647] [2021-12-18 21:18:29,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291925647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:29,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:29,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:18:29,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874617968] [2021-12-18 21:18:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:29,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:18:29,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:18:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:18:29,916 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:29,949 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-12-18 21:18:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:18:29,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-12-18 21:18:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:29,950 INFO L225 Difference]: With dead ends: 84 [2021-12-18 21:18:29,950 INFO L226 Difference]: Without dead ends: 84 [2021-12-18 21:18:29,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:18:29,951 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:29,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 357 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:18:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-18 21:18:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-18 21:18:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.25) internal successors, (80), 76 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-18 21:18:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-12-18 21:18:29,953 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 38 [2021-12-18 21:18:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:29,953 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-12-18 21:18:29,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-18 21:18:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-12-18 21:18:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 21:18:29,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:29,953 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:29,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:30,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:30,154 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293974, now seen corresponding path program 1 times [2021-12-18 21:18:30,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:30,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118209355] [2021-12-18 21:18:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:30,155 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:30,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:30,156 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) [2021-12-18 21:18:30,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 21:18:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:30,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:18:30,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:30,317 INFO L388 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 [2021-12-18 21:18:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:30,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:30,473 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:30,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118209355] [2021-12-18 21:18:30,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118209355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:30,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:30,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 21:18:30,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672422512] [2021-12-18 21:18:30,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:30,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 21:18:30,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 21:18:30,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:18:30,474 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:30,705 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-12-18 21:18:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:18:30,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-12-18 21:18:30,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:30,706 INFO L225 Difference]: With dead ends: 115 [2021-12-18 21:18:30,707 INFO L226 Difference]: Without dead ends: 115 [2021-12-18 21:18:30,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-12-18 21:18:30,707 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:30,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 358 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2021-12-18 21:18:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-18 21:18:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2021-12-18 21:18:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 90 states have internal predecessors, (97), 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) [2021-12-18 21:18:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-12-18 21:18:30,710 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 46 [2021-12-18 21:18:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:30,710 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-12-18 21:18:30,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-12-18 21:18:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 21:18:30,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:30,711 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:30,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:30,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:30,911 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293975, now seen corresponding path program 1 times [2021-12-18 21:18:30,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:30,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703041944] [2021-12-18 21:18:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:30,912 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:30,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:30,913 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) [2021-12-18 21:18:30,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 21:18:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:31,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 21:18:31,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:31,095 INFO L388 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 [2021-12-18 21:18:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:31,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:31,335 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:31,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703041944] [2021-12-18 21:18:31,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703041944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:31,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:31,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:18:31,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386741913] [2021-12-18 21:18:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:31,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:18:31,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:18:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:18:31,336 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:31,583 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2021-12-18 21:18:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 21:18:31,583 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-12-18 21:18:31,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:31,584 INFO L225 Difference]: With dead ends: 125 [2021-12-18 21:18:31,584 INFO L226 Difference]: Without dead ends: 125 [2021-12-18 21:18:31,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:18:31,584 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 127 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:31,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 402 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2021-12-18 21:18:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-18 21:18:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2021-12-18 21:18:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 98 states have internal predecessors, (113), 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) [2021-12-18 21:18:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2021-12-18 21:18:31,588 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 46 [2021-12-18 21:18:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:31,588 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2021-12-18 21:18:31,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2021-12-18 21:18:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 21:18:31,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:31,588 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:31,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:31,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:31,796 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -882834383, now seen corresponding path program 1 times [2021-12-18 21:18:31,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:31,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93738861] [2021-12-18 21:18:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:31,797 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:31,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:31,798 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) [2021-12-18 21:18:31,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 21:18:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:31,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 21:18:31,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:32,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:32,071 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:32,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93738861] [2021-12-18 21:18:32,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93738861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:32,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:32,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:18:32,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680781346] [2021-12-18 21:18:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:32,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:18:32,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:18:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:18:32,072 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2021-12-18 21:18:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:32,150 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2021-12-18 21:18:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:18:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 52 [2021-12-18 21:18:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:32,152 INFO L225 Difference]: With dead ends: 111 [2021-12-18 21:18:32,152 INFO L226 Difference]: Without dead ends: 109 [2021-12-18 21:18:32,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:18:32,152 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:32,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 431 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:18:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-18 21:18:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2021-12-18 21:18:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 98 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) [2021-12-18 21:18:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2021-12-18 21:18:32,154 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 52 [2021-12-18 21:18:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:32,154 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2021-12-18 21:18:32,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2021-12-18 21:18:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2021-12-18 21:18:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 21:18:32,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:32,155 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:32,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:32,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:32,355 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash -644390150, now seen corresponding path program 1 times [2021-12-18 21:18:32,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:32,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058710594] [2021-12-18 21:18:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:32,356 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:32,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:32,357 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) [2021-12-18 21:18:32,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 21:18:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:32,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-18 21:18:32,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:32,647 INFO L388 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 [2021-12-18 21:18:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:32,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:32,819 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:32,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058710594] [2021-12-18 21:18:32,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058710594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:32,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:32,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:18:32,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891713745] [2021-12-18 21:18:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:32,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:18:32,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:18:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:18:32,820 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:33,108 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2021-12-18 21:18:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:18:33,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-12-18 21:18:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:33,109 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:18:33,109 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:18:33,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:18:33,110 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:33,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 387 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2021-12-18 21:18:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:18:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2021-12-18 21:18:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 97 states have internal predecessors, (109), 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) [2021-12-18 21:18:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2021-12-18 21:18:33,114 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 52 [2021-12-18 21:18:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:33,114 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2021-12-18 21:18:33,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2021-12-18 21:18:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 21:18:33,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:33,115 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:33,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-18 21:18:33,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:33,327 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash -644390149, now seen corresponding path program 1 times [2021-12-18 21:18:33,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:33,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192910155] [2021-12-18 21:18:33,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:33,328 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:33,329 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) [2021-12-18 21:18:33,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 21:18:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:33,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-18 21:18:33,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:33,587 INFO L388 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 [2021-12-18 21:18:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:33,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:33,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:33,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192910155] [2021-12-18 21:18:33,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192910155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:33,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:33,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 21:18:33,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774348057] [2021-12-18 21:18:33,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:33,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:18:33,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:33,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:18:33,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:18:33,940 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:34,316 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2021-12-18 21:18:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:18:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-12-18 21:18:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:34,318 INFO L225 Difference]: With dead ends: 114 [2021-12-18 21:18:34,318 INFO L226 Difference]: Without dead ends: 114 [2021-12-18 21:18:34,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:18:34,319 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 126 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:34,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 442 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 241 Invalid, 0 Unknown, 15 Unchecked, 0.3s Time] [2021-12-18 21:18:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-18 21:18:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2021-12-18 21:18:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 97 states have internal predecessors, (107), 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) [2021-12-18 21:18:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2021-12-18 21:18:34,321 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 52 [2021-12-18 21:18:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:34,321 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2021-12-18 21:18:34,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2021-12-18 21:18:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 21:18:34,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:34,322 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:34,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:34,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:34,531 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1476913121, now seen corresponding path program 1 times [2021-12-18 21:18:34,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:34,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137437689] [2021-12-18 21:18:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:34,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:34,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:34,534 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) [2021-12-18 21:18:34,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 21:18:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:34,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-18 21:18:34,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:35,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:35,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:35,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137437689] [2021-12-18 21:18:35,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137437689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:35,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:35,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:18:35,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484540905] [2021-12-18 21:18:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:35,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:18:35,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:18:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:18:35,091 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:35,409 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2021-12-18 21:18:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:18:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-12-18 21:18:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:35,410 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:18:35,410 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:18:35,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-18 21:18:35,410 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 170 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:35,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 502 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 211 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2021-12-18 21:18:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:18:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2021-12-18 21:18:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 97 states have internal predecessors, (106), 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) [2021-12-18 21:18:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2021-12-18 21:18:35,413 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 55 [2021-12-18 21:18:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:35,413 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2021-12-18 21:18:35,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 21:18:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2021-12-18 21:18:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-18 21:18:35,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:35,413 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:35,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:35,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:35,615 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:35,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1073931710, now seen corresponding path program 1 times [2021-12-18 21:18:35,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:35,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239285459] [2021-12-18 21:18:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:35,616 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:35,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:35,627 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) [2021-12-18 21:18:35,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 21:18:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:35,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-18 21:18:35,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:36,075 INFO L388 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 [2021-12-18 21:18:36,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,106 INFO L388 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 [2021-12-18 21:18:36,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,142 INFO L388 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 [2021-12-18 21:18:36,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,179 INFO L388 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 [2021-12-18 21:18:36,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,220 INFO L388 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 [2021-12-18 21:18:36,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,259 INFO L388 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 [2021-12-18 21:18:36,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,306 INFO L388 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 [2021-12-18 21:18:36,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,363 INFO L388 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 [2021-12-18 21:18:36,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,421 INFO L388 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 [2021-12-18 21:18:36,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,472 INFO L388 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 [2021-12-18 21:18:36,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,530 INFO L388 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 [2021-12-18 21:18:36,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,589 INFO L388 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 [2021-12-18 21:18:36,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,632 INFO L388 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 [2021-12-18 21:18:36,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,695 INFO L388 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 [2021-12-18 21:18:36,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,740 INFO L388 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 [2021-12-18 21:18:36,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,782 INFO L388 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 [2021-12-18 21:18:36,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:36,976 INFO L388 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 [2021-12-18 21:18:41,996 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1615 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1613) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_1615)))) is different from true [2021-12-18 21:18:42,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,018 INFO L388 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 [2021-12-18 21:18:42,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:42,244 INFO L388 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 [2021-12-18 21:18:42,331 INFO L388 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 [2021-12-18 21:18:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:42,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:18:43,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:43,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239285459] [2021-12-18 21:18:43,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239285459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:18:43,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1823682925] [2021-12-18 21:18:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:43,203 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 21:18:43,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 21:18:43,205 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 21:18:43,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2021-12-18 21:18:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:43,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-18 21:18:43,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:43,825 INFO L388 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 [2021-12-18 21:18:43,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:43,873 INFO L388 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 [2021-12-18 21:18:43,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:43,896 INFO L388 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 [2021-12-18 21:18:43,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:43,925 INFO L388 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 [2021-12-18 21:18:43,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:43,949 INFO L388 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 [2021-12-18 21:18:43,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:43,970 INFO L388 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 [2021-12-18 21:18:43,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:43,987 INFO L388 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 [2021-12-18 21:18:44,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,015 INFO L388 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 [2021-12-18 21:18:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,039 INFO L388 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 [2021-12-18 21:18:44,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,064 INFO L388 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 [2021-12-18 21:18:44,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,087 INFO L388 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 [2021-12-18 21:18:44,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,113 INFO L388 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 [2021-12-18 21:18:44,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,132 INFO L388 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 [2021-12-18 21:18:44,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,148 INFO L388 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 [2021-12-18 21:18:44,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,177 INFO L388 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 [2021-12-18 21:18:44,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,188 INFO L388 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 [2021-12-18 21:18:44,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:44,247 INFO L388 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 [2021-12-18 21:18:47,355 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1811 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1613) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_1811)))) is different from true [2021-12-18 21:18:47,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:47,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:47,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:47,369 INFO L388 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 [2021-12-18 21:18:47,478 INFO L388 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 [2021-12-18 21:18:47,579 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:18:47,579 INFO L388 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 [2021-12-18 21:18:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:18:47,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:18:49,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1823682925] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:18:49,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:18:49,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 44 [2021-12-18 21:18:49,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901248107] [2021-12-18 21:18:49,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:18:49,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-18 21:18:49,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-18 21:18:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3198, Unknown=3, NotChecked=230, Total=3660 [2021-12-18 21:18:49,152 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 21:18:53,483 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1811 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1613) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_1811)))) (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1615 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1613) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_1615))))) is different from true [2021-12-18 21:18:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:54,295 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-12-18 21:18:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-18 21:18:54,296 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2021-12-18 21:18:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:54,297 INFO L225 Difference]: With dead ends: 121 [2021-12-18 21:18:54,297 INFO L226 Difference]: Without dead ends: 121 [2021-12-18 21:18:54,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=560, Invalid=7458, Unknown=4, NotChecked=534, Total=8556 [2021-12-18 21:18:54,299 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 204 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:54,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 839 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1246 Invalid, 0 Unknown, 310 Unchecked, 1.7s Time] [2021-12-18 21:18:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-18 21:18:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2021-12-18 21:18:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.206896551724138) internal successors, (105), 97 states have internal predecessors, (105), 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) [2021-12-18 21:18:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-12-18 21:18:54,303 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 58 [2021-12-18 21:18:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:54,303 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-12-18 21:18:54,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 21:18:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-12-18 21:18:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-18 21:18:54,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:54,304 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:54,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:54,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:54,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-18 21:18:54,718 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896519, now seen corresponding path program 1 times [2021-12-18 21:18:54,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:54,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094021765] [2021-12-18 21:18:54,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:54,718 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:54,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:54,719 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) [2021-12-18 21:18:54,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-18 21:18:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:54,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:18:54,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:54,987 INFO L388 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 [2021-12-18 21:18:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:55,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:18:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:55,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:55,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094021765] [2021-12-18 21:18:55,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094021765] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:18:55,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:18:55,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2021-12-18 21:18:55,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123271530] [2021-12-18 21:18:55,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:18:55,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:18:55,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:55,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:18:55,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:18:55,391 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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) [2021-12-18 21:18:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:55,747 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2021-12-18 21:18:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:18:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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 60 [2021-12-18 21:18:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:55,749 INFO L225 Difference]: With dead ends: 146 [2021-12-18 21:18:55,749 INFO L226 Difference]: Without dead ends: 146 [2021-12-18 21:18:55,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-12-18 21:18:55,749 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 114 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:55,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 447 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 46 Unchecked, 0.3s Time] [2021-12-18 21:18:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-18 21:18:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2021-12-18 21:18:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 117 states have internal predecessors, (127), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:18:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-12-18 21:18:55,752 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 60 [2021-12-18 21:18:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:55,752 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-12-18 21:18:55,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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) [2021-12-18 21:18:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-12-18 21:18:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-18 21:18:55,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:55,753 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:55,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:55,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:55,961 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:55,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896518, now seen corresponding path program 1 times [2021-12-18 21:18:55,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:55,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959627383] [2021-12-18 21:18:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:55,962 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:55,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:55,963 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) [2021-12-18 21:18:55,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-18 21:18:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:56,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 21:18:56,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:56,270 INFO L388 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 [2021-12-18 21:18:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:18:56,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:18:56,619 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:56,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959627383] [2021-12-18 21:18:56,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959627383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:18:56,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:18:56,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:18:56,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871378777] [2021-12-18 21:18:56,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:18:56,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:18:56,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:56,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:18:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:18:56,628 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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) [2021-12-18 21:18:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:56,832 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2021-12-18 21:18:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:18:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 60 [2021-12-18 21:18:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:56,834 INFO L225 Difference]: With dead ends: 135 [2021-12-18 21:18:56,834 INFO L226 Difference]: Without dead ends: 135 [2021-12-18 21:18:56,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:18:56,834 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:56,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 413 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2021-12-18 21:18:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-18 21:18:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2021-12-18 21:18:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2) internal successors, (126), 117 states have internal predecessors, (126), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:18:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2021-12-18 21:18:56,837 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 60 [2021-12-18 21:18:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:56,837 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2021-12-18 21:18:56,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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) [2021-12-18 21:18:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2021-12-18 21:18:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-18 21:18:56,837 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:56,837 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:56,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:57,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:18:57,043 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:18:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1067855226, now seen corresponding path program 1 times [2021-12-18 21:18:57,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:57,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624636365] [2021-12-18 21:18:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:57,044 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:57,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:57,048 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) [2021-12-18 21:18:57,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-18 21:18:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:57,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-18 21:18:57,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:57,481 INFO L388 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 [2021-12-18 21:18:57,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-18 21:18:57,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-18 21:18:57,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-18 21:18:57,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-18 21:18:57,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-18 21:18:57,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,772 INFO L388 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 [2021-12-18 21:18:57,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,843 INFO L388 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 [2021-12-18 21:18:57,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,881 INFO L388 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 [2021-12-18 21:18:57,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,932 INFO L388 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 [2021-12-18 21:18:57,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:57,972 INFO L388 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 [2021-12-18 21:18:58,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,023 INFO L388 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 [2021-12-18 21:18:58,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,073 INFO L388 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 [2021-12-18 21:18:58,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,127 INFO L388 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 [2021-12-18 21:18:58,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,175 INFO L388 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 [2021-12-18 21:18:58,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,227 INFO L388 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 [2021-12-18 21:18:58,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:18:58,449 INFO L388 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 [2021-12-18 21:19:03,741 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2289 (_ 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_2286) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2289)))) is different from true [2021-12-18 21:19:03,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:03,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:03,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:03,759 INFO L388 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 [2021-12-18 21:19:04,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:04,041 INFO L388 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 [2021-12-18 21:19:04,156 INFO L388 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 [2021-12-18 21:19:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:19:04,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:19:05,102 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:19:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624636365] [2021-12-18 21:19:05,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624636365] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:19:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1923449046] [2021-12-18 21:19:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:19:05,102 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 21:19:05,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 21:19:05,103 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 21:19:05,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-12-18 21:19:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:19:05,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-18 21:19:05,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:19:05,748 INFO L388 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 [2021-12-18 21:19:05,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,778 INFO L388 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 [2021-12-18 21:19:05,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,805 INFO L388 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 [2021-12-18 21:19:05,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-18 21:19:05,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-18 21:19:05,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,878 INFO L388 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 [2021-12-18 21:19:05,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,909 INFO L388 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 [2021-12-18 21:19:05,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,947 INFO L388 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 [2021-12-18 21:19:05,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,962 INFO L388 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 [2021-12-18 21:19:05,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,976 INFO L388 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 [2021-12-18 21:19:05,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:05,990 INFO L388 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 [2021-12-18 21:19:06,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,013 INFO L388 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 [2021-12-18 21:19:06,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,030 INFO L388 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 [2021-12-18 21:19:06,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,047 INFO L388 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 [2021-12-18 21:19:06,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,060 INFO L388 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 [2021-12-18 21:19:06,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,075 INFO L388 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 [2021-12-18 21:19:06,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:06,129 INFO L388 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 [2021-12-18 21:19:09,130 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2483 (_ BitVec 32)) (v_ArrVal_2286 (_ 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_2286) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2483)))) is different from true [2021-12-18 21:19:09,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:09,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:09,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:19:09,146 INFO L388 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 [2021-12-18 21:19:09,309 INFO L388 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 [2021-12-18 21:19:09,417 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:19:09,418 INFO L388 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 [2021-12-18 21:19:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:19:09,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:19:11,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1923449046] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:19:11,002 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:19:11,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 46 [2021-12-18 21:19:11,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425861786] [2021-12-18 21:19:11,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:19:11,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-18 21:19:11,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:19:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-18 21:19:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3299, Unknown=3, NotChecked=234, Total=3782 [2021-12-18 21:19:11,003 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 21:19:14,743 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (_ BitVec 32)) (v_ArrVal_2286 (_ 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_2286) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2483)))) (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2289 (_ 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_2286) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2289))))) is different from true [2021-12-18 21:19:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:19:15,673 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2021-12-18 21:19:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-18 21:19:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2021-12-18 21:19:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:19:15,674 INFO L225 Difference]: With dead ends: 140 [2021-12-18 21:19:15,674 INFO L226 Difference]: Without dead ends: 139 [2021-12-18 21:19:15,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 89 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=481, Invalid=5379, Unknown=4, NotChecked=456, Total=6320 [2021-12-18 21:19:15,676 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 174 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-18 21:19:15,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 934 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1304 Invalid, 0 Unknown, 251 Unchecked, 1.9s Time] [2021-12-18 21:19:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-18 21:19:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2021-12-18 21:19:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 114 states have internal predecessors, (120), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:19:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2021-12-18 21:19:15,679 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 59 [2021-12-18 21:19:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:19:15,679 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2021-12-18 21:19:15,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-18 21:19:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2021-12-18 21:19:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-18 21:19:15,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:19:15,679 INFO L514 BasicCegarLoop]: trace histogram [16, 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] [2021-12-18 21:19:15,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2021-12-18 21:19:15,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-18 21:19:16,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:19:16,085 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:19:16,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:19:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1066761989, now seen corresponding path program 1 times [2021-12-18 21:19:16,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:19:16,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542668777] [2021-12-18 21:19:16,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:19:16,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:19:16,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:19:16,087 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) [2021-12-18 21:19:16,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-18 21:19:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:19:16,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 21:19:16,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:19:16,401 INFO L388 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 [2021-12-18 21:19:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:19:16,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:19:16,777 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:19:16,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542668777] [2021-12-18 21:19:16,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542668777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:19:16,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:19:16,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:19:16,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330624345] [2021-12-18 21:19:16,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:19:16,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:19:16,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:19:16,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:19:16,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:19:16,779 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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) [2021-12-18 21:19:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:19:17,004 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-12-18 21:19:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:19:17,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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 62 [2021-12-18 21:19:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:19:17,006 INFO L225 Difference]: With dead ends: 129 [2021-12-18 21:19:17,006 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 21:19:17,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:19:17,006 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 29 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:19:17,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 335 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2021-12-18 21:19:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 21:19:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2021-12-18 21:19:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 114 states have internal predecessors, (119), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:19:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2021-12-18 21:19:17,009 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 62 [2021-12-18 21:19:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:19:17,009 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2021-12-18 21:19:17,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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) [2021-12-18 21:19:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2021-12-18 21:19:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-18 21:19:17,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:19:17,011 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:19:17,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-18 21:19:17,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:19:17,221 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:19:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:19:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1335956715, now seen corresponding path program 1 times [2021-12-18 21:19:17,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:19:17,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961907659] [2021-12-18 21:19:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:19:17,222 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:19:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:19:17,223 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) [2021-12-18 21:19:17,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-18 21:19:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:19:17,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:19:17,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:19:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-18 21:19:17,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:19:17,647 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:19:17,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961907659] [2021-12-18 21:19:17,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961907659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:19:17,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:19:17,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:19:17,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688030715] [2021-12-18 21:19:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:19:17,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:19:17,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:19:17,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:19:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:19:17,648 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 21:19:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:19:17,721 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2021-12-18 21:19:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:19:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 63 [2021-12-18 21:19:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:19:17,723 INFO L225 Difference]: With dead ends: 129 [2021-12-18 21:19:17,723 INFO L226 Difference]: Without dead ends: 125 [2021-12-18 21:19:17,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:19:17,723 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:19:17,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 429 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:19:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-18 21:19:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-18 21:19:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 114 states have internal predecessors, (117), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:19:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2021-12-18 21:19:17,726 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 63 [2021-12-18 21:19:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:19:17,726 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2021-12-18 21:19:17,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 21:19:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2021-12-18 21:19:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-18 21:19:17,727 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:19:17,727 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:19:17,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-18 21:19:17,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:19:17,940 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:19:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:19:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836323, now seen corresponding path program 1 times [2021-12-18 21:19:17,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:19:17,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238413341] [2021-12-18 21:19:17,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:19:17,940 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:19:17,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:19:17,942 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:19:17,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-18 21:19:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:19:18,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-18 21:19:18,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:19:18,306 INFO L388 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 [2021-12-18 21:19:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:19:18,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:19:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:19:18,719 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:19:18,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238413341] [2021-12-18 21:19:18,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238413341] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:19:18,719 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:19:18,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2021-12-18 21:19:18,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228878821] [2021-12-18 21:19:18,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:19:18,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:19:18,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:19:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:19:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:19:18,721 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 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) [2021-12-18 21:19:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:19:19,046 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-12-18 21:19:19,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 21:19:19,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 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 66 [2021-12-18 21:19:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:19:19,047 INFO L225 Difference]: With dead ends: 127 [2021-12-18 21:19:19,047 INFO L226 Difference]: Without dead ends: 127 [2021-12-18 21:19:19,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-12-18 21:19:19,048 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:19:19,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2021-12-18 21:19:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-18 21:19:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2021-12-18 21:19:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.1553398058252426) internal successors, (119), 115 states have internal predecessors, (119), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:19:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2021-12-18 21:19:19,050 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 66 [2021-12-18 21:19:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:19:19,050 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2021-12-18 21:19:19,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 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) [2021-12-18 21:19:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2021-12-18 21:19:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-18 21:19:19,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:19:19,051 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:19:19,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-18 21:19:19,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:19:19,253 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:19:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:19:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836322, now seen corresponding path program 1 times [2021-12-18 21:19:19,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:19:19,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636648388] [2021-12-18 21:19:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:19:19,254 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:19:19,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:19:19,255 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) [2021-12-18 21:19:19,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-18 21:19:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:19:19,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 21:19:19,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:19:19,621 INFO L388 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 [2021-12-18 21:19:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:19:19,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:19:19,999 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:19:19,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636648388] [2021-12-18 21:19:19,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636648388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:19:19,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:19:19,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 21:19:19,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673084300] [2021-12-18 21:19:19,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:19:19,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:19:20,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:19:20,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:19:20,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:19:20,000 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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) [2021-12-18 21:19:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:19:20,296 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2021-12-18 21:19:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:19:20,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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 66 [2021-12-18 21:19:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:19:20,297 INFO L225 Difference]: With dead ends: 129 [2021-12-18 21:19:20,297 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 21:19:20,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:19:20,298 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:19:20,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 440 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2021-12-18 21:19:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 21:19:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2021-12-18 21:19:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.145631067961165) internal successors, (118), 115 states have internal predecessors, (118), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:19:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2021-12-18 21:19:20,300 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 66 [2021-12-18 21:19:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:19:20,300 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2021-12-18 21:19:20,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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) [2021-12-18 21:19:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2021-12-18 21:19:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-18 21:19:20,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:19:20,301 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:19:20,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-18 21:19:20,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:19:20,501 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:19:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:19:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1739148477, now seen corresponding path program 1 times [2021-12-18 21:19:20,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:19:20,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360538450] [2021-12-18 21:19:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:19:20,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:19:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:19:20,503 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:19:20,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-18 21:19:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:19:20,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:19:20,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:19:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:19:21,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:19:21,033 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:19:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360538450] [2021-12-18 21:19:21,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360538450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:19:21,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:19:21,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 21:19:21,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245136895] [2021-12-18 21:19:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:19:21,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 21:19:21,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:19:21,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 21:19:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:19:21,034 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 21:19:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:19:21,131 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-12-18 21:19:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 21:19:21,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2021-12-18 21:19:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:19:21,132 INFO L225 Difference]: With dead ends: 125 [2021-12-18 21:19:21,132 INFO L226 Difference]: Without dead ends: 125 [2021-12-18 21:19:21,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-12-18 21:19:21,133 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:19:21,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 677 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:19:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-18 21:19:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-18 21:19:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 114 states have internal predecessors, (117), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:19:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2021-12-18 21:19:21,136 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 68 [2021-12-18 21:19:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:19:21,136 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2021-12-18 21:19:21,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 21:19:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2021-12-18 21:19:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 21:19:21,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:19:21,137 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:19:21,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-18 21:19:21,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:19:21,349 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:19:21,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:19:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1920971938, now seen corresponding path program 1 times [2021-12-18 21:19:21,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:19:21,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159019753] [2021-12-18 21:19:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:19:21,350 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:19:21,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:19:21,351 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) [2021-12-18 21:19:21,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-18 21:19:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:19:21,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-18 21:19:21,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:19:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:19:22,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:19:22,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:19:22,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159019753] [2021-12-18 21:19:22,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159019753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:19:22,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:19:22,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:19:22,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150961903] [2021-12-18 21:19:22,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:19:22,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:19:22,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:19:22,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:19:22,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:19:22,192 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 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) [2021-12-18 21:19:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:19:22,383 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2021-12-18 21:19:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:19:22,383 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 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 69 [2021-12-18 21:19:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:19:22,384 INFO L225 Difference]: With dead ends: 138 [2021-12-18 21:19:22,384 INFO L226 Difference]: Without dead ends: 138 [2021-12-18 21:19:22,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-12-18 21:19:22,384 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 91 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:19:22,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 455 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2021-12-18 21:19:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-18 21:19:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2021-12-18 21:19:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.1320754716981132) internal successors, (120), 117 states have internal predecessors, (120), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-18 21:19:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2021-12-18 21:19:22,388 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 69 [2021-12-18 21:19:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:19:22,389 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2021-12-18 21:19:22,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 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) [2021-12-18 21:19:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2021-12-18 21:19:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 21:19:22,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:19:22,389 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:19:22,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-12-18 21:19:22,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:19:22,600 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2021-12-18 21:19:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:19:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295794, now seen corresponding path program 1 times [2021-12-18 21:19:22,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:19:22,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812227926] [2021-12-18 21:19:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:19:22,601 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:19:22,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:19:22,602 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:19:22,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-18 21:19:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:19:22,982 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 21:19:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:19:23,252 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-18 21:19:23,253 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 21:19:23,253 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_kobject_putErr0REQUIRES_VIOLATION (20 of 21 remaining) [2021-12-18 21:19:23,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2021-12-18 21:19:23,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2021-12-18 21:19:23,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (17 of 21 remaining) [2021-12-18 21:19:23,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (16 of 21 remaining) [2021-12-18 21:19:23,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (15 of 21 remaining) [2021-12-18 21:19:23,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (14 of 21 remaining) [2021-12-18 21:19:23,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION (13 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION (12 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION (11 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATION (10 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATION (9 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATION (8 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATION (7 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATION (6 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2021-12-18 21:19:23,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2021-12-18 21:19:23,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2021-12-18 21:19:23,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2021-12-18 21:19:23,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2021-12-18 21:19:23,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 21 remaining) [2021-12-18 21:19:23,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-12-18 21:19:23,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:19:23,473 INFO L732 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] [2021-12-18 21:19:23,476 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 21:19:23,483 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,483 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,483 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,483 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,484 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,484 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,484 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,484 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,484 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,484 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,485 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,485 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,492 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,492 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,492 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,493 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,493 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,493 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,493 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,493 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,493 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,493 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,494 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,494 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,494 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,494 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,494 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,494 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,495 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,495 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,495 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,495 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,495 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,495 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,495 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,496 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,496 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,496 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,496 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,496 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,496 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,496 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,497 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,497 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,497 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,497 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,497 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,497 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,497 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,498 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,498 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,498 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,498 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,498 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,498 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,498 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,499 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,499 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,499 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,499 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,500 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,500 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,500 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,500 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,500 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,500 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,500 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,500 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,501 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,501 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,501 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,501 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,501 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,501 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,502 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,502 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,507 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,507 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,507 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,507 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,507 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,508 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,508 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,508 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:19:23 BoogieIcfgContainer [2021-12-18 21:19:23,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 21:19:23,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 21:19:23,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 21:19:23,532 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 21:19:23,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:18:20" (3/4) ... [2021-12-18 21:19:23,534 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-18 21:19:23,536 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,539 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,544 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,544 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,544 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,549 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,549 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,549 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,549 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,549 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 21:19:23,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 21:19:23,586 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 21:19:23,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 21:19:23,587 INFO L158 Benchmark]: Toolchain (without parser) took 64676.54ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 40.3MB in the beginning and 38.3MB in the end (delta: 2.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2021-12-18 21:19:23,587 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:19:23,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.71ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 26.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-18 21:19:23,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.31ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 26.7MB in the beginning and 54.4MB in the end (delta: -27.7MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2021-12-18 21:19:23,587 INFO L158 Benchmark]: Boogie Preprocessor took 34.87ms. Allocated memory is still 73.4MB. Free memory was 54.4MB in the beginning and 52.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:19:23,588 INFO L158 Benchmark]: RCFGBuilder took 500.18ms. Allocated memory is still 73.4MB. Free memory was 52.3MB in the beginning and 53.5MB in the end (delta: -1.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2021-12-18 21:19:23,588 INFO L158 Benchmark]: TraceAbstraction took 63515.52ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 53.1MB in the beginning and 48.7MB in the end (delta: 4.4MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2021-12-18 21:19:23,588 INFO L158 Benchmark]: Witness Printer took 54.78ms. Allocated memory is still 88.1MB. Free memory was 48.1MB in the beginning and 38.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 21:19:23,589 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.18ms. Allocated memory is still 60.8MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.71ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 26.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.31ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 26.7MB in the beginning and 54.4MB in the end (delta: -27.7MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.87ms. Allocated memory is still 73.4MB. Free memory was 54.4MB in the beginning and 52.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.18ms. Allocated memory is still 73.4MB. Free memory was 52.3MB in the beginning and 53.5MB in the end (delta: -1.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63515.52ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 53.1MB in the beginning and 48.7MB in the end (delta: 4.4MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * Witness Printer took 54.78ms. Allocated memory is still 88.1MB. Free memory was 48.1MB in the beginning and 38.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 666]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L770] CALL entry_point() [L764] struct ldv_kobject *kobj; [L765] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(*kobj))={2:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) VAL [kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}] [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [ldv_global_msg_list={1:0}, list={2:4}] [L540] list->next = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L541] list->prev = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L765] RET, EXPR ldv_kobject_create() [L765] kobj = ldv_kobject_create() [L766] CALL f_22_put(kobj) [L761] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] EXPR v->counter VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}, v->counter=1] [L666] temp = v->counter [L667] temp -= i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L668] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L669] return temp; VAL [\old(i)=1, \result=0, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L675] CALL release(kref) [L706] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L706] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L707] CALL ldv_kobject_cleanup(kobj) [L699] EXPR kobj->name VAL [kobj={2:0}, kobj={2:0}, kobj->name={0:0}, ldv_global_msg_list={1:0}] [L699] char *name = kobj->name; [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) [L701] COND FALSE !(\read(*name)) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L707] RET ldv_kobject_cleanup(kobj) [L675] RET release(kref) [L676] return 1; VAL [\old(count)=1, \result=1, count=1, kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}, release={-1:0}, release={-1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L761] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L766] RET f_22_put(kobj) [L767] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL ldv_kref_sub(kref, 1, release) [L674] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] v->counter - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 666]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 668]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 668]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 63.4s, OverallIterations: 34, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2061 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2035 mSDsluCounter, 14373 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 822 IncrementalHoareTripleChecker+Unchecked, 12136 mSDsCounter, 367 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6463 IncrementalHoareTripleChecker+Invalid, 7652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 367 mSolverCounterUnsat, 2237 mSDtfsCounter, 6463 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1263 SyntacticMatches, 40 SemanticMatches, 522 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4318 ImplicationChecksByTransitivity, 32.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=25, InterpolantAutomatonStates: 402, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 241 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1581 ConstructedInterpolants, 139 QuantifiedInterpolants, 10940 SizeOfPredicates, 540 NumberOfNonLiveVariables, 9457 ConjunctsInSsa, 1030 ConjunctsInUnsatCore, 40 InterpolantComputations, 26 PerfectInterpolantSequences, 2829/3527 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-18 21:19:23,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)