./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 ff03de63 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-dev-ff03de6 [2021-12-21 18:11:42,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:11:42,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:11:42,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:11:42,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:11:42,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:11:42,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:11:42,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:11:42,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:11:42,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:11:42,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:11:42,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:11:42,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:11:42,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:11:42,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:11:42,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:11:42,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:11:42,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:11:42,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:11:42,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:11:42,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:11:42,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:11:42,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:11:42,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:11:42,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:11:42,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:11:42,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:11:42,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:11:42,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:11:42,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:11:42,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:11:42,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:11:42,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:11:42,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:11:42,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:11:42,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:11:42,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:11:42,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:11:42,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:11:42,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:11:42,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:11:42,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-21 18:11:42,897 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:11:42,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:11:42,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:11:42,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:11:42,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:11:42,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:11:42,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:11:42,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:11:42,899 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:11:42,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:11:42,900 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:11:42,900 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:11:42,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:11:42,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:11:42,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:11:42,901 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:11:42,901 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:11:42,901 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:11:42,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:11:42,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:11:42,902 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:11:42,902 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:11:42,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:11:42,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:11:42,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:11:42,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:11:42,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:11:42,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:11:42,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:11:42,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:11:42,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:11:42,903 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-21 18:11:43,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:11:43,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:11:43,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:11:43,101 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:11:43,102 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:11:43,103 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-21 18:11:43,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103cd1932/9347e9eb4ecb42579c908af3ed3a8016/FLAG826ad4a5a [2021-12-21 18:11:43,579 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:11:43,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2021-12-21 18:11:43,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103cd1932/9347e9eb4ecb42579c908af3ed3a8016/FLAG826ad4a5a [2021-12-21 18:11:43,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103cd1932/9347e9eb4ecb42579c908af3ed3a8016 [2021-12-21 18:11:43,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:11:43,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:11:43,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:11:43,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:11:43,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:11:43,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:11:43" (1/1) ... [2021-12-21 18:11:43,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fab3bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:43, skipping insertion in model container [2021-12-21 18:11:43,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:11:43" (1/1) ... [2021-12-21 18:11:43,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:11:43,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:11:43,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:11:43,862 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-21 18:11:43,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7052722d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:43, skipping insertion in model container [2021-12-21 18:11:43,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:11:43,863 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-21 18:11:43,864 INFO L158 Benchmark]: Toolchain (without parser) took 255.24ms. Allocated memory is still 115.3MB. Free memory was 86.1MB in the beginning and 86.1MB in the end (delta: 6.9kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 18:11:43,864 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory was 71.7MB in the beginning and 71.6MB in the end (delta: 51.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:11:43,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.58ms. Allocated memory is still 115.3MB. Free memory was 85.8MB in the beginning and 86.1MB in the end (delta: -331.9kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 18:11:43,866 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 115.3MB. Free memory was 71.7MB in the beginning and 71.6MB in the end (delta: 51.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.58ms. Allocated memory is still 115.3MB. Free memory was 85.8MB in the beginning and 86.1MB in the end (delta: -331.9kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types 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-dev-ff03de6 [2021-12-21 18:11:45,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:11:45,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:11:45,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:11:45,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:11:45,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:11:45,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:11:45,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:11:45,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:11:45,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:11:45,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:11:45,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:11:45,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:11:45,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:11:45,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:11:45,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:11:45,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:11:45,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:11:45,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:11:45,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:11:45,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:11:45,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:11:45,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:11:45,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:11:45,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:11:45,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:11:45,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:11:45,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:11:45,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:11:45,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:11:45,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:11:45,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:11:45,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:11:45,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:11:45,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:11:45,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:11:45,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:11:45,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:11:45,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:11:45,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:11:45,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:11:45,419 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-21 18:11:45,447 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:11:45,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:11:45,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:11:45,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:11:45,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:11:45,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:11:45,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:11:45,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:11:45,451 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:11:45,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:11:45,452 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:11:45,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:11:45,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:11:45,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:11:45,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:11:45,453 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:11:45,453 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:11:45,453 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:11:45,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:11:45,453 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:11:45,454 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 18:11:45,454 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 18:11:45,454 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:11:45,454 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:11:45,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:11:45,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:11:45,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:11:45,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:11:45,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:11:45,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:11:45,462 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 18:11:45,463 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 18:11:45,463 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:11:45,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 18:11:45,463 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-21 18:11:45,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:11:45,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:11:45,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:11:45,750 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:11:45,751 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:11:45,752 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-21 18:11:45,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b768c1a/d8bc74c602e04548b8e6d8f4310b0d78/FLAGa6c0266ea [2021-12-21 18:11:46,173 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:11:46,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2021-12-21 18:11:46,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b768c1a/d8bc74c602e04548b8e6d8f4310b0d78/FLAGa6c0266ea [2021-12-21 18:11:46,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b768c1a/d8bc74c602e04548b8e6d8f4310b0d78 [2021-12-21 18:11:46,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:11:46,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:11:46,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:11:46,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:11:46,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:11:46,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:11:46" (1/1) ... [2021-12-21 18:11:46,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a75f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:46, skipping insertion in model container [2021-12-21 18:11:46,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:11:46" (1/1) ... [2021-12-21 18:11:46,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:11:46,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:11:46,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:11:46,870 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-21 18:11:46,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:11:46,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:11:46,945 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:11:46,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:11:47,036 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:11:47,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47 WrapperNode [2021-12-21 18:11:47,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:11:47,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:11:47,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:11:47,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:11:47,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,106 INFO L137 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 24, calls inlined = 15, statements flattened = 102 [2021-12-21 18:11:47,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:11:47,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:11:47,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:11:47,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:11:47,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:11:47,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:11:47,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:11:47,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:11:47,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (1/1) ... [2021-12-21 18:11:47,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:11:47,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:11:47,180 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-21 18:11:47,187 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-21 18:11:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-21 18:11:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-12-21 18:11:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-12-21 18:11:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-21 18:11:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-21 18:11:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-12-21 18:11:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-12-21 18:11:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:11:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:11:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:11:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:11:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-21 18:11:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:11:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 18:11:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:11:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:11:47,314 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:11:47,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:11:47,572 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:11:47,577 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:11:47,577 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 18:11:47,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:11:47 BoogieIcfgContainer [2021-12-21 18:11:47,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:11:47,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:11:47,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:11:47,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:11:47,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:11:46" (1/3) ... [2021-12-21 18:11:47,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0940f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:11:47, skipping insertion in model container [2021-12-21 18:11:47,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:47" (2/3) ... [2021-12-21 18:11:47,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0940f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:11:47, skipping insertion in model container [2021-12-21 18:11:47,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:11:47" (3/3) ... [2021-12-21 18:11:47,602 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2021-12-21 18:11:47,605 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:11:47,606 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-21 18:11:47,633 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:11:47,637 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-21 18:11:47,637 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-21 18:11:47,646 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-21 18:11:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:11:47,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:47,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:47,652 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-21 18:11:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:47,655 INFO L85 PathProgramCache]: Analyzing trace with hash -544283271, now seen corresponding path program 1 times [2021-12-21 18:11:47,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:47,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920535190] [2021-12-21 18:11:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:47,664 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:47,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:47,665 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-21 18:11:47,666 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-21 18:11:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:47,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:11:47,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:47,834 INFO L387 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-21 18:11:47,878 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-21 18:11:47,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:47,879 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920535190] [2021-12-21 18:11:47,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920535190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:47,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:47,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:11:47,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514041488] [2021-12-21 18:11:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:47,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:11:47,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:11:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:11:47,915 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-21 18:11:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:48,149 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2021-12-21 18:11:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:48,151 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-21 18:11:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:48,156 INFO L225 Difference]: With dead ends: 102 [2021-12-21 18:11:48,156 INFO L226 Difference]: Without dead ends: 100 [2021-12-21 18:11:48,158 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-21 18:11:48,160 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 18:11:48,160 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-21 18:11:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-21 18:11:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 81. [2021-12-21 18:11:48,184 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-21 18:11:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-12-21 18:11:48,186 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 10 [2021-12-21 18:11:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:48,187 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-12-21 18:11:48,187 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-21 18:11:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-12-21 18:11:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:11:48,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:48,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:48,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:48,396 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-21 18:11:48,396 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-21 18:11:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:48,397 INFO L85 PathProgramCache]: Analyzing trace with hash -515654120, now seen corresponding path program 1 times [2021-12-21 18:11:48,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:48,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012129402] [2021-12-21 18:11:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:48,398 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:48,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:48,400 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-21 18:11:48,401 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-21 18:11:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:48,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:11:48,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:48,522 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-21 18:11:48,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:48,523 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:48,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012129402] [2021-12-21 18:11:48,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012129402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:48,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:48,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:11:48,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482598076] [2021-12-21 18:11:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:48,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:11:48,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:48,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:11:48,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:11:48,525 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-21 18:11:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:48,545 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2021-12-21 18:11:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:11:48,546 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-21 18:11:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:48,547 INFO L225 Difference]: With dead ends: 86 [2021-12-21 18:11:48,547 INFO L226 Difference]: Without dead ends: 86 [2021-12-21 18:11:48,548 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-21 18:11:48,549 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-21 18:11:48,549 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-21 18:11:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-21 18:11:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2021-12-21 18:11:48,554 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-21 18:11:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2021-12-21 18:11:48,556 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 10 [2021-12-21 18:11:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:48,556 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2021-12-21 18:11:48,557 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-21 18:11:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2021-12-21 18:11:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:11:48,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:48,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:48,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-21 18:11:48,762 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-21 18:11:48,763 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-21 18:11:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash 307087832, now seen corresponding path program 1 times [2021-12-21 18:11:48,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:48,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695460014] [2021-12-21 18:11:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:48,764 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:48,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:48,765 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-21 18:11:48,766 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-21 18:11:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:48,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 18:11:48,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:48,828 INFO L387 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-21 18:11:48,925 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-21 18:11:48,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:48,925 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:48,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695460014] [2021-12-21 18:11:48,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695460014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:48,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:48,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:11:48,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571189878] [2021-12-21 18:11:48,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:48,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:11:48,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:11:48,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:11:48,927 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-21 18:11:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:49,143 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2021-12-21 18:11:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:49,145 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-21 18:11:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:49,146 INFO L225 Difference]: With dead ends: 92 [2021-12-21 18:11:49,146 INFO L226 Difference]: Without dead ends: 92 [2021-12-21 18:11:49,146 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-21 18:11:49,147 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 18:11:49,147 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-21 18:11:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-21 18:11:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2021-12-21 18:11:49,155 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-21 18:11:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2021-12-21 18:11:49,158 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 11 [2021-12-21 18:11:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:49,159 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2021-12-21 18:11:49,160 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-21 18:11:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2021-12-21 18:11:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 18:11:49,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:49,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:49,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:49,367 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-21 18:11:49,367 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-21 18:11:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash 149796357, now seen corresponding path program 1 times [2021-12-21 18:11:49,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:49,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989360497] [2021-12-21 18:11:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:49,369 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:49,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:49,370 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-21 18:11:49,383 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-21 18:11:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:49,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:11:49,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:49,496 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-21 18:11:49,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:49,497 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:49,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989360497] [2021-12-21 18:11:49,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989360497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:49,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:49,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:11:49,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662267715] [2021-12-21 18:11:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:49,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:11:49,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:49,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:11:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:11:49,499 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-21 18:11:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:49,520 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2021-12-21 18:11:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:11:49,521 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-21 18:11:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:49,522 INFO L225 Difference]: With dead ends: 85 [2021-12-21 18:11:49,522 INFO L226 Difference]: Without dead ends: 85 [2021-12-21 18:11:49,523 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-21 18:11:49,529 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-21 18:11:49,531 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-21 18:11:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-21 18:11:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2021-12-21 18:11:49,541 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-21 18:11:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-21 18:11:49,545 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 14 [2021-12-21 18:11:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:49,545 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-21 18:11:49,545 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-21 18:11:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-21 18:11:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 18:11:49,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:49,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:49,557 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-21 18:11:49,753 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-21 18:11:49,753 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-21 18:11:49,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash -46717148, now seen corresponding path program 1 times [2021-12-21 18:11:49,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:49,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615153844] [2021-12-21 18:11:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:49,754 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:49,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:49,755 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-21 18:11:49,757 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-21 18:11:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:49,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 18:11:49,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:49,891 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-21 18:11:49,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:49,891 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:49,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615153844] [2021-12-21 18:11:49,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615153844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:49,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:49,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:11:49,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162483058] [2021-12-21 18:11:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:49,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:11:49,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:49,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:11:49,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:11:49,893 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-21 18:11:49,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:49,936 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-12-21 18:11:49,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:49,937 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-21 18:11:49,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:49,939 INFO L225 Difference]: With dead ends: 91 [2021-12-21 18:11:49,939 INFO L226 Difference]: Without dead ends: 91 [2021-12-21 18:11:49,939 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-21 18:11:49,941 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-21 18:11:49,942 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-21 18:11:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-21 18:11:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2021-12-21 18:11:49,955 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-21 18:11:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-12-21 18:11:49,956 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2021-12-21 18:11:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:49,956 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-12-21 18:11:49,956 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-21 18:11:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-12-21 18:11:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 18:11:49,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:49,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:49,965 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-21 18:11:50,163 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-21 18:11:50,164 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-21 18:11:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash -945781721, now seen corresponding path program 1 times [2021-12-21 18:11:50,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:50,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861487635] [2021-12-21 18:11:50,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:50,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:50,166 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-21 18:11:50,167 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-21 18:11:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:50,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:11:50,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:50,251 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-21 18:11:50,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:50,252 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:50,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861487635] [2021-12-21 18:11:50,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861487635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:50,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:50,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:11:50,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585768502] [2021-12-21 18:11:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:50,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:11:50,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:11:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:11:50,254 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-21 18:11:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:50,270 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2021-12-21 18:11:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:11:50,270 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-21 18:11:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:50,271 INFO L225 Difference]: With dead ends: 90 [2021-12-21 18:11:50,271 INFO L226 Difference]: Without dead ends: 90 [2021-12-21 18:11:50,271 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-21 18:11:50,272 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-21 18:11:50,272 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-21 18:11:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-21 18:11:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2021-12-21 18:11:50,275 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-21 18:11:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-12-21 18:11:50,275 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2021-12-21 18:11:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:50,276 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-12-21 18:11:50,276 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-21 18:11:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-12-21 18:11:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-21 18:11:50,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:50,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:50,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-21 18:11:50,485 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-21 18:11:50,485 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-21 18:11:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash 686278594, now seen corresponding path program 1 times [2021-12-21 18:11:50,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:50,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947241222] [2021-12-21 18:11:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:50,486 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:50,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:50,487 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-21 18:11:50,488 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-21 18:11:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:50,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:11:50,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:50,604 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-21 18:11:50,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:11:50,668 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-21 18:11:50,669 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947241222] [2021-12-21 18:11:50,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947241222] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:11:50,669 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:11:50,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-21 18:11:50,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024828272] [2021-12-21 18:11:50,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:11:50,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:11:50,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:11:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:11:50,671 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-21 18:11:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:50,727 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2021-12-21 18:11:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:50,728 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-21 18:11:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:50,729 INFO L225 Difference]: With dead ends: 93 [2021-12-21 18:11:50,729 INFO L226 Difference]: Without dead ends: 93 [2021-12-21 18:11:50,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:11:50,729 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-21 18:11:50,730 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-21 18:11:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-21 18:11:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2021-12-21 18:11:50,732 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-21 18:11:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2021-12-21 18:11:50,733 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 17 [2021-12-21 18:11:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:50,733 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2021-12-21 18:11:50,733 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-21 18:11:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2021-12-21 18:11:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 18:11:50,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:50,734 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-21 18:11:50,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:50,941 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-21 18:11:50,941 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-21 18:11:50,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1101750465, now seen corresponding path program 1 times [2021-12-21 18:11:50,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:50,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165660998] [2021-12-21 18:11:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:50,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:50,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:50,944 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-21 18:11:50,945 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-21 18:11:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:50,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:11:51,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:51,071 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-21 18:11:51,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:51,072 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:51,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165660998] [2021-12-21 18:11:51,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165660998] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:51,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:51,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:11:51,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167885461] [2021-12-21 18:11:51,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:51,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:11:51,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:11:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:11:51,074 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-21 18:11:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:51,115 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-12-21 18:11:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:51,116 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-21 18:11:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:51,117 INFO L225 Difference]: With dead ends: 99 [2021-12-21 18:11:51,117 INFO L226 Difference]: Without dead ends: 99 [2021-12-21 18:11:51,117 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-21 18:11:51,117 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-21 18:11:51,118 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-21 18:11:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-21 18:11:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2021-12-21 18:11:51,120 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-21 18:11:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-12-21 18:11:51,121 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 20 [2021-12-21 18:11:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:51,121 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-12-21 18:11:51,121 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-21 18:11:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-12-21 18:11:51,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 18:11:51,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:51,122 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:51,141 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-21 18:11:51,328 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-21 18:11:51,331 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-21 18:11:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473369, now seen corresponding path program 2 times [2021-12-21 18:11:51,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:51,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445640383] [2021-12-21 18:11:51,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:11:51,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:51,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:51,332 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-21 18:11:51,333 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-21 18:11:51,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 18:11:51,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:11:51,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 18:11:51,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:51,394 INFO L387 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-21 18:11:51,458 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-21 18:11:51,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:51,458 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:51,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445640383] [2021-12-21 18:11:51,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445640383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:51,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:51,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:11:51,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772069091] [2021-12-21 18:11:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:51,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:11:51,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:11:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:11:51,459 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-21 18:11:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:51,657 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-12-21 18:11:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:11:51,658 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-21 18:11:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:51,658 INFO L225 Difference]: With dead ends: 100 [2021-12-21 18:11:51,658 INFO L226 Difference]: Without dead ends: 100 [2021-12-21 18:11:51,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:11:51,659 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-21 18:11:51,659 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-21 18:11:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-21 18:11:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-12-21 18:11:51,661 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-21 18:11:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-12-21 18:11:51,662 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 20 [2021-12-21 18:11:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:51,662 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-12-21 18:11:51,662 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-21 18:11:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-12-21 18:11:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 18:11:51,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:51,662 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:51,672 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-21 18:11:51,863 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-21 18:11:51,863 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-21 18:11:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473368, now seen corresponding path program 1 times [2021-12-21 18:11:51,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:51,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925200011] [2021-12-21 18:11:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:51,864 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:51,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:51,865 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-21 18:11:51,865 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-21 18:11:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:51,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:11:51,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:52,020 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-21 18:11:52,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:11:52,179 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-21 18:11:52,179 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:52,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925200011] [2021-12-21 18:11:52,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925200011] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:11:52,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:11:52,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-21 18:11:52,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543565768] [2021-12-21 18:11:52,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:11:52,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 18:11:52,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:52,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 18:11:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-21 18:11:52,181 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-21 18:11:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:52,360 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-12-21 18:11:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:11:52,360 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-21 18:11:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:52,361 INFO L225 Difference]: With dead ends: 102 [2021-12-21 18:11:52,361 INFO L226 Difference]: Without dead ends: 102 [2021-12-21 18:11:52,361 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-21 18:11:52,362 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-21 18:11:52,362 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-21 18:11:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-21 18:11:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2021-12-21 18:11:52,364 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-21 18:11:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2021-12-21 18:11:52,364 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 20 [2021-12-21 18:11:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:52,365 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2021-12-21 18:11:52,365 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-21 18:11:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2021-12-21 18:11:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 18:11:52,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:52,365 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-21 18:11:52,372 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-21 18:11:52,572 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-21 18:11:52,572 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-21 18:11:52,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:52,572 INFO L85 PathProgramCache]: Analyzing trace with hash -62141083, now seen corresponding path program 1 times [2021-12-21 18:11:52,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:52,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150265995] [2021-12-21 18:11:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:52,573 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:52,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:52,574 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-21 18:11:52,574 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-21 18:11:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:52,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:11:52,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:52,676 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-21 18:11:52,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:52,677 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:52,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150265995] [2021-12-21 18:11:52,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150265995] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:52,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:52,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:11:52,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323056371] [2021-12-21 18:11:52,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:52,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:11:52,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:52,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:11:52,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:11:52,679 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-21 18:11:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:52,762 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-12-21 18:11:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:11:52,763 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-21 18:11:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:52,763 INFO L225 Difference]: With dead ends: 105 [2021-12-21 18:11:52,763 INFO L226 Difference]: Without dead ends: 87 [2021-12-21 18:11:52,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:11:52,764 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-21 18:11:52,764 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-21 18:11:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-21 18:11:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2021-12-21 18:11:52,766 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-21 18:11:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2021-12-21 18:11:52,766 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 23 [2021-12-21 18:11:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:52,766 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2021-12-21 18:11:52,766 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-21 18:11:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2021-12-21 18:11:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 18:11:52,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:52,767 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:52,773 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-21 18:11:52,973 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-21 18:11:52,973 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-21 18:11:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2043849464, now seen corresponding path program 2 times [2021-12-21 18:11:52,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:52,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325546603] [2021-12-21 18:11:52,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:11:52,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:52,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:52,975 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-21 18:11:52,975 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-21 18:11:53,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 18:11:53,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:11:53,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-21 18:11:53,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:53,084 INFO L387 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-21 18:11:53,238 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-21 18:11:53,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:53,239 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:53,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325546603] [2021-12-21 18:11:53,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325546603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:53,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:53,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:11:53,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591508210] [2021-12-21 18:11:53,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:53,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:11:53,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:53,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:11:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:53,241 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-21 18:11:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:53,518 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2021-12-21 18:11:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:11:53,519 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-21 18:11:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:53,520 INFO L225 Difference]: With dead ends: 99 [2021-12-21 18:11:53,520 INFO L226 Difference]: Without dead ends: 99 [2021-12-21 18:11:53,520 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-21 18:11:53,520 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-21 18:11:53,520 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-21 18:11:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-21 18:11:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2021-12-21 18:11:53,522 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-21 18:11:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-12-21 18:11:53,523 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 26 [2021-12-21 18:11:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:53,523 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-12-21 18:11:53,523 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-21 18:11:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-12-21 18:11:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:11:53,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:53,524 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-21 18:11:53,542 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-21 18:11:53,730 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-21 18:11:53,730 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-21 18:11:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1441027708, now seen corresponding path program 1 times [2021-12-21 18:11:53,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:53,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860796819] [2021-12-21 18:11:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:53,732 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:53,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:53,733 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-21 18:11:53,733 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-21 18:11:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:53,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 18:11:53,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:54,019 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-21 18:11:54,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:11:54,410 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-21 18:11:54,411 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:54,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860796819] [2021-12-21 18:11:54,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860796819] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:11:54,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:11:54,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-21 18:11:54,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871935909] [2021-12-21 18:11:54,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:11:54,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-21 18:11:54,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 18:11:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2021-12-21 18:11:54,414 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-21 18:11:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:54,751 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-12-21 18:11:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:11:54,752 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-21 18:11:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:54,752 INFO L225 Difference]: With dead ends: 88 [2021-12-21 18:11:54,752 INFO L226 Difference]: Without dead ends: 88 [2021-12-21 18:11:54,753 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-21 18:11:54,753 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 32 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-21 18:11:54,753 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-21 18:11:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-21 18:11:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-21 18:11:54,755 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-21 18:11:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2021-12-21 18:11:54,756 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 30 [2021-12-21 18:11:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:54,756 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2021-12-21 18:11:54,756 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-21 18:11:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2021-12-21 18:11:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:11:54,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:54,757 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-21 18:11:54,768 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-21 18:11:54,964 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-21 18:11:54,964 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-21 18:11:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107868, now seen corresponding path program 2 times [2021-12-21 18:11:54,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:54,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991472907] [2021-12-21 18:11:54,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:11:54,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:54,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:54,972 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-21 18:11:54,974 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-21 18:11:55,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 18:11:55,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:11:55,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-21 18:11:55,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:55,068 INFO L387 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-21 18:11:55,257 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-21 18:11:55,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:55,258 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:55,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991472907] [2021-12-21 18:11:55,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991472907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:55,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:55,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:11:55,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634669033] [2021-12-21 18:11:55,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:55,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 18:11:55,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:55,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 18:11:55,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:11:55,259 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-21 18:11:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:55,522 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-21 18:11:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:11:55,523 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-21 18:11:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:55,523 INFO L225 Difference]: With dead ends: 94 [2021-12-21 18:11:55,523 INFO L226 Difference]: Without dead ends: 94 [2021-12-21 18:11:55,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-21 18:11:55,524 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.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:55,524 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.2s Time] [2021-12-21 18:11:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-21 18:11:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2021-12-21 18:11:55,526 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-21 18:11:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-21 18:11:55,526 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 36 [2021-12-21 18:11:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:55,526 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-21 18:11:55,526 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-21 18:11:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-21 18:11:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:11:55,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:55,527 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-21 18:11:55,537 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-21 18:11:55,727 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-21 18:11:55,727 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-21 18:11:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107867, now seen corresponding path program 1 times [2021-12-21 18:11:55,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:55,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30135647] [2021-12-21 18:11:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:55,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:55,729 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-21 18:11:55,795 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-21 18:11:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:55,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 18:11:55,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:55,898 INFO L387 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-21 18:11:55,986 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-21 18:11:55,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:55,987 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:55,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30135647] [2021-12-21 18:11:55,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30135647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:55,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:55,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:11:55,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806438400] [2021-12-21 18:11:55,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:55,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:11:55,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:55,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:11:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:55,989 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-21 18:11:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:56,193 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2021-12-21 18:11:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:11:56,194 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-21 18:11:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:56,194 INFO L225 Difference]: With dead ends: 87 [2021-12-21 18:11:56,194 INFO L226 Difference]: Without dead ends: 87 [2021-12-21 18:11:56,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:11:56,195 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:56,195 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.2s Time] [2021-12-21 18:11:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-21 18:11:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2021-12-21 18:11:56,197 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-21 18:11:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2021-12-21 18:11:56,197 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 36 [2021-12-21 18:11:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:56,197 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2021-12-21 18:11:56,198 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-21 18:11:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2021-12-21 18:11:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:11:56,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:56,198 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-21 18:11:56,208 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-21 18:11:56,398 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-21 18:11:56,399 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-21 18:11:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash 94582189, now seen corresponding path program 1 times [2021-12-21 18:11:56,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:56,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160951598] [2021-12-21 18:11:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:56,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:56,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:56,400 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-21 18:11:56,401 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-21 18:11:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:56,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:11:56,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:56,582 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-21 18:11:56,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:56,583 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160951598] [2021-12-21 18:11:56,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160951598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:56,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:56,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:11:56,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528143495] [2021-12-21 18:11:56,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:56,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:11:56,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:11:56,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:11:56,584 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-21 18:11:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:56,637 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-12-21 18:11:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:11:56,638 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-21 18:11:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:56,638 INFO L225 Difference]: With dead ends: 84 [2021-12-21 18:11:56,638 INFO L226 Difference]: Without dead ends: 84 [2021-12-21 18:11:56,638 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-21 18:11:56,639 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-21 18:11:56,639 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-21 18:11:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-21 18:11:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-21 18:11:56,641 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-21 18:11:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-12-21 18:11:56,641 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 36 [2021-12-21 18:11:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:56,642 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-12-21 18:11:56,642 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-21 18:11:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-12-21 18:11:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 18:11:56,642 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:56,642 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-21 18:11:56,650 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-21 18:11:56,850 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-21 18:11:56,850 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-21 18:11:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2072333273, now seen corresponding path program 1 times [2021-12-21 18:11:56,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:56,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878463914] [2021-12-21 18:11:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:56,851 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:56,852 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-21 18:11:56,852 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-21 18:11:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:56,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:11:56,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:57,056 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-21 18:11:57,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:57,056 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:57,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878463914] [2021-12-21 18:11:57,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878463914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:57,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:57,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:11:57,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17560196] [2021-12-21 18:11:57,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:57,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:11:57,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:57,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:11:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:11:57,058 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-21 18:11:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:57,104 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-12-21 18:11:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:57,105 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-21 18:11:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:57,106 INFO L225 Difference]: With dead ends: 84 [2021-12-21 18:11:57,106 INFO L226 Difference]: Without dead ends: 84 [2021-12-21 18:11:57,106 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-21 18:11:57,106 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-21 18:11:57,107 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-21 18:11:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-21 18:11:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-21 18:11:57,108 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-21 18:11:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-12-21 18:11:57,109 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 38 [2021-12-21 18:11:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:57,109 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-12-21 18:11:57,109 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-21 18:11:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-12-21 18:11:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:11:57,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:57,110 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-21 18:11:57,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-21 18:11:57,318 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-21 18:11:57,319 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-21 18:11:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293974, now seen corresponding path program 1 times [2021-12-21 18:11:57,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:57,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066999717] [2021-12-21 18:11:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:57,319 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:57,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:57,320 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-21 18:11:57,321 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-21 18:11:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:57,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 18:11:57,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:57,509 INFO L387 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-21 18:11:57,662 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-21 18:11:57,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:57,662 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:57,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066999717] [2021-12-21 18:11:57,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066999717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:57,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:57,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:11:57,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240308763] [2021-12-21 18:11:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:57,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:11:57,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:11:57,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:11:57,666 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-21 18:11:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:57,927 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-12-21 18:11:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:11:57,928 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-21 18:11:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:57,928 INFO L225 Difference]: With dead ends: 115 [2021-12-21 18:11:57,928 INFO L226 Difference]: Without dead ends: 115 [2021-12-21 18:11:57,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:11:57,929 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-21 18:11:57,929 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-21 18:11:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-21 18:11:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2021-12-21 18:11:57,932 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-21 18:11:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-12-21 18:11:57,933 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 46 [2021-12-21 18:11:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:57,933 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-12-21 18:11:57,933 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-21 18:11:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-12-21 18:11:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:11:57,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:57,934 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-21 18:11:57,943 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-21 18:11:58,142 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-21 18:11:58,143 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-21 18:11:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293975, now seen corresponding path program 1 times [2021-12-21 18:11:58,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:58,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674331455] [2021-12-21 18:11:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:58,144 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:58,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:58,144 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-21 18:11:58,147 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-21 18:11:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:58,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-21 18:11:58,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:58,350 INFO L387 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-21 18:11:58,637 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-21 18:11:58,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:58,637 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674331455] [2021-12-21 18:11:58,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674331455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:58,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:58,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:11:58,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710972812] [2021-12-21 18:11:58,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:58,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:11:58,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:11:58,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:11:58,639 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-21 18:11:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:58,958 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2021-12-21 18:11:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 18:11:58,959 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-21 18:11:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:58,960 INFO L225 Difference]: With dead ends: 125 [2021-12-21 18:11:58,960 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 18:11:58,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:11:58,961 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-21 18:11:58,961 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-21 18:11:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 18:11:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2021-12-21 18:11:58,966 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-21 18:11:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2021-12-21 18:11:58,967 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 46 [2021-12-21 18:11:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:58,967 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2021-12-21 18:11:58,967 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-21 18:11:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2021-12-21 18:11:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-21 18:11:58,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:58,968 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-21 18:11:58,987 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-21 18:11:59,176 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-21 18:11:59,177 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-21 18:11:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash -882834383, now seen corresponding path program 1 times [2021-12-21 18:11:59,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:59,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204188953] [2021-12-21 18:11:59,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:59,178 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:59,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:59,178 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-21 18:11:59,180 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-21 18:11:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:59,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 18:11:59,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:59,470 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-21 18:11:59,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:59,471 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:59,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204188953] [2021-12-21 18:11:59,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204188953] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:59,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:59,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:11:59,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482714810] [2021-12-21 18:11:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:59,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:11:59,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:59,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:11:59,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:59,472 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-21 18:11:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:59,541 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2021-12-21 18:11:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:11:59,541 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-21 18:11:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:59,542 INFO L225 Difference]: With dead ends: 111 [2021-12-21 18:11:59,542 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 18:11:59,542 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-21 18:11:59,543 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.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:59,543 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.0s Time] [2021-12-21 18:11:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 18:11:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2021-12-21 18:11:59,544 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-21 18:11:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2021-12-21 18:11:59,545 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 52 [2021-12-21 18:11:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:59,545 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2021-12-21 18:11:59,545 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-21 18:11:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2021-12-21 18:11:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-21 18:11:59,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:59,546 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-21 18:11:59,558 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-21 18:11:59,746 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-21 18:11:59,746 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-21 18:11:59,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash -644390150, now seen corresponding path program 1 times [2021-12-21 18:11:59,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:59,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644169168] [2021-12-21 18:11:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:59,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:59,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:59,748 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-21 18:11:59,749 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-21 18:11:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:59,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 18:11:59,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:59,968 INFO L387 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-21 18:12:00,122 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-21 18:12:00,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:00,122 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644169168] [2021-12-21 18:12:00,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644169168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:00,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:00,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:12:00,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576681107] [2021-12-21 18:12:00,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:00,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:12:00,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:00,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:12:00,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:12:00,124 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-21 18:12:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:00,412 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2021-12-21 18:12:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:12:00,412 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-21 18:12:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:00,413 INFO L225 Difference]: With dead ends: 113 [2021-12-21 18:12:00,413 INFO L226 Difference]: Without dead ends: 113 [2021-12-21 18:12:00,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:12:00,414 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-21 18:12:00,414 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-21 18:12:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-21 18:12:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2021-12-21 18:12:00,416 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-21 18:12:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2021-12-21 18:12:00,416 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 52 [2021-12-21 18:12:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:00,417 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2021-12-21 18:12:00,417 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-21 18:12:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2021-12-21 18:12:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-21 18:12:00,417 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:00,418 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-21 18:12:00,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-21 18:12:00,627 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-21 18:12:00,627 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-21 18:12:00,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash -644390149, now seen corresponding path program 1 times [2021-12-21 18:12:00,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:00,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496172814] [2021-12-21 18:12:00,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:00,629 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:00,629 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-21 18:12:00,630 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-21 18:12:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:00,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-21 18:12:00,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:00,844 INFO L387 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-21 18:12:01,172 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-21 18:12:01,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:01,172 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:01,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496172814] [2021-12-21 18:12:01,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496172814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:01,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:01,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-21 18:12:01,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025955702] [2021-12-21 18:12:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:01,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:12:01,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:01,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:12:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:12:01,173 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-21 18:12:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:01,503 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2021-12-21 18:12:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:12:01,503 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-21 18:12:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:01,504 INFO L225 Difference]: With dead ends: 114 [2021-12-21 18:12:01,504 INFO L226 Difference]: Without dead ends: 114 [2021-12-21 18:12:01,504 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-21 18:12:01,505 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.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:12:01,505 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.2s Time] [2021-12-21 18:12:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-21 18:12:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2021-12-21 18:12:01,507 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-21 18:12:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2021-12-21 18:12:01,508 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 52 [2021-12-21 18:12:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:01,508 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2021-12-21 18:12:01,508 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-21 18:12:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2021-12-21 18:12:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-21 18:12:01,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:01,509 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-21 18:12:01,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-21 18:12:01,715 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-21 18:12:01,715 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-21 18:12:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1476913121, now seen corresponding path program 1 times [2021-12-21 18:12:01,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:01,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579743017] [2021-12-21 18:12:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:01,716 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:01,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:01,717 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-21 18:12:01,718 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-21 18:12:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:01,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 18:12:01,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:02,294 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-21 18:12:02,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:02,294 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:02,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579743017] [2021-12-21 18:12:02,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579743017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:02,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:02,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:12:02,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181424402] [2021-12-21 18:12:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:02,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:12:02,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:02,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:12:02,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:12:02,296 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-21 18:12:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:02,602 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2021-12-21 18:12:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:12:02,602 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-21 18:12:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:02,603 INFO L225 Difference]: With dead ends: 113 [2021-12-21 18:12:02,603 INFO L226 Difference]: Without dead ends: 113 [2021-12-21 18:12:02,603 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-21 18:12:02,604 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-21 18:12:02,604 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-21 18:12:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-21 18:12:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2021-12-21 18:12:02,605 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-21 18:12:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2021-12-21 18:12:02,612 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 55 [2021-12-21 18:12:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:02,612 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2021-12-21 18:12:02,612 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-21 18:12:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2021-12-21 18:12:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-21 18:12:02,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:02,613 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-21 18:12:02,633 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-21 18:12:02,813 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-21 18:12:02,813 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-21 18:12:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1073931710, now seen corresponding path program 1 times [2021-12-21 18:12:02,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:02,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958493073] [2021-12-21 18:12:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:02,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:02,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:02,815 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-21 18:12:02,821 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-21 18:12:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:03,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-21 18:12:03,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:03,233 INFO L387 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-21 18:12:03,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,265 INFO L387 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-21 18:12:03,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,296 INFO L387 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-21 18:12:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,324 INFO L387 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-21 18:12:03,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,356 INFO L387 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-21 18:12:03,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,395 INFO L387 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-21 18:12:03,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,436 INFO L387 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-21 18:12:03,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,472 INFO L387 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-21 18:12:03,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,512 INFO L387 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-21 18:12:03,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,550 INFO L387 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-21 18:12:03,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,591 INFO L387 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-21 18:12:03,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,630 INFO L387 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-21 18:12:03,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,673 INFO L387 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-21 18:12:03,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,718 INFO L387 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-21 18:12:03,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,762 INFO L387 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-21 18:12:03,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,809 INFO L387 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-21 18:12:03,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:03,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:04,000 INFO L387 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-21 18:12:09,076 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 (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1615)))) is different from true [2021-12-21 18:12:09,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,095 INFO L387 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-21 18:12:09,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:09,310 INFO L387 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-21 18:12:09,415 INFO L387 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-21 18:12:09,480 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-21 18:12:09,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:12:10,246 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:10,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958493073] [2021-12-21 18:12:10,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958493073] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:12:10,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [280321098] [2021-12-21 18:12:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:10,247 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-21 18:12:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-21 18:12:10,249 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-21 18:12:10,266 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-21 18:12:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:10,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-21 18:12:10,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:10,850 INFO L387 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-21 18:12:10,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:10,890 INFO L387 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-21 18:12:10,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:10,914 INFO L387 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-21 18:12:10,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:10,948 INFO L387 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-21 18:12:10,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:10,973 INFO L387 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-21 18:12:11,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,004 INFO L387 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-21 18:12:11,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,022 INFO L387 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-21 18:12:11,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,043 INFO L387 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-21 18:12:11,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,072 INFO L387 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-21 18:12:11,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,088 INFO L387 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-21 18:12:11,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,105 INFO L387 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-21 18:12:11,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,142 INFO L387 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-21 18:12:11,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,162 INFO L387 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-21 18:12:11,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,201 INFO L387 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-21 18:12:11,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,236 INFO L387 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-21 18:12:11,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,284 INFO L387 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-21 18:12:11,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:11,343 INFO L387 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-21 18:12:14,534 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1810 (_ 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 (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1810)))) is different from true [2021-12-21 18:12:14,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:14,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:14,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:14,548 INFO L387 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-21 18:12:14,655 INFO L387 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-21 18:12:14,746 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:12:14,747 INFO L387 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-21 18:12:14,832 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-21 18:12:14,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:12:16,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [280321098] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:12:16,143 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:12:16,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 44 [2021-12-21 18:12:16,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319865543] [2021-12-21 18:12:16,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:12:16,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-21 18:12:16,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:16,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-21 18:12:16,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3198, Unknown=3, NotChecked=230, Total=3660 [2021-12-21 18:12:16,145 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-21 18:12:20,451 WARN L860 $PredicateComparison]: unable to prove that (and (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 (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1615)))) (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1810 (_ 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 (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1810))))) is different from true [2021-12-21 18:12:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:21,417 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-12-21 18:12:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-21 18:12:21,419 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-21 18:12:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:21,419 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:12:21,420 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:12:21,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=560, Invalid=7458, Unknown=4, NotChecked=534, Total=8556 [2021-12-21 18:12:21,422 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 204 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2021-12-21 18:12:21,422 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.8s Time] [2021-12-21 18:12:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:12:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2021-12-21 18:12:21,425 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-21 18:12:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-12-21 18:12:21,426 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 58 [2021-12-21 18:12:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:21,427 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-12-21 18:12:21,427 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-21 18:12:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-12-21 18:12:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 18:12:21,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:21,428 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-21 18:12:21,448 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-21 18:12:21,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2021-12-21 18:12:21,843 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-21 18:12:21,843 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-21 18:12:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896519, now seen corresponding path program 1 times [2021-12-21 18:12:21,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:21,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982989631] [2021-12-21 18:12:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:21,844 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:21,845 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-21 18:12:21,845 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-21 18:12:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:22,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 18:12:22,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:22,114 INFO L387 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-21 18:12:22,284 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-21 18:12:22,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:12:22,521 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-21 18:12:22,521 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:22,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982989631] [2021-12-21 18:12:22,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982989631] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:12:22,521 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:12:22,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2021-12-21 18:12:22,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415513212] [2021-12-21 18:12:22,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:12:22,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:12:22,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:22,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:12:22,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:12:22,523 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-21 18:12:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:22,949 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2021-12-21 18:12:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 18:12:22,949 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-21 18:12:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:22,950 INFO L225 Difference]: With dead ends: 146 [2021-12-21 18:12:22,950 INFO L226 Difference]: Without dead ends: 146 [2021-12-21 18:12:22,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-12-21 18:12:22,951 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 114 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-21 18:12:22,951 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-21 18:12:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-21 18:12:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2021-12-21 18:12:22,953 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-21 18:12:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-12-21 18:12:22,954 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 60 [2021-12-21 18:12:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:22,954 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-12-21 18:12:22,954 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-21 18:12:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-12-21 18:12:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 18:12:22,955 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:22,955 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-21 18:12:22,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-21 18:12:23,155 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-21 18:12:23,155 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-21 18:12:23,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896518, now seen corresponding path program 1 times [2021-12-21 18:12:23,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:23,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967047995] [2021-12-21 18:12:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:23,156 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:23,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:23,157 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-21 18:12:23,158 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-21 18:12:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:23,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:12:23,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:23,454 INFO L387 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-21 18:12:23,817 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-21 18:12:23,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:23,817 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:23,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967047995] [2021-12-21 18:12:23,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967047995] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:23,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:23,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:12:23,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590635082] [2021-12-21 18:12:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:23,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:12:23,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:12:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:12:23,819 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-21 18:12:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:24,040 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2021-12-21 18:12:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:12:24,041 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-21 18:12:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:24,042 INFO L225 Difference]: With dead ends: 135 [2021-12-21 18:12:24,042 INFO L226 Difference]: Without dead ends: 135 [2021-12-21 18:12:24,042 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-21 18:12:24,042 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-21 18:12:24,042 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-21 18:12:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-21 18:12:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2021-12-21 18:12:24,048 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-21 18:12:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2021-12-21 18:12:24,049 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 60 [2021-12-21 18:12:24,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:24,049 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2021-12-21 18:12:24,049 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-21 18:12:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2021-12-21 18:12:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 18:12:24,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:24,050 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-21 18:12:24,062 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-21 18:12:24,260 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-21 18:12:24,260 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-21 18:12:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1067855226, now seen corresponding path program 1 times [2021-12-21 18:12:24,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:24,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657014019] [2021-12-21 18:12:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:24,262 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:24,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:24,263 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-21 18:12:24,265 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-21 18:12:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:24,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-21 18:12:24,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:24,742 INFO L387 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-21 18:12:24,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:24,773 INFO L387 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-21 18:12:24,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:24,817 INFO L387 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-21 18:12:24,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:24,860 INFO L387 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-21 18:12:24,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:24,904 INFO L387 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-21 18:12:24,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:24,945 INFO L387 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-21 18:12:24,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:24,996 INFO L387 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-21 18:12:25,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,043 INFO L387 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-21 18:12:25,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,083 INFO L387 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-21 18:12:25,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,134 INFO L387 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-21 18:12:25,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,179 INFO L387 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-21 18:12:25,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,236 INFO L387 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-21 18:12:25,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,279 INFO L387 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-21 18:12:25,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,330 INFO L387 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-21 18:12:25,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,378 INFO L387 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-21 18:12:25,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,424 INFO L387 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-21 18:12:25,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:25,589 INFO L387 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-21 18:12:30,934 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2288 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2286) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2288)) |c_#memory_$Pointer$.base|)) is different from true [2021-12-21 18:12:30,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:30,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:30,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:30,947 INFO L387 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-21 18:12:31,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:31,159 INFO L387 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-21 18:12:31,250 INFO L387 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-21 18:12:31,342 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-21 18:12:31,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:12:32,142 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:32,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657014019] [2021-12-21 18:12:32,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657014019] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:12:32,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [527898482] [2021-12-21 18:12:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:32,143 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-21 18:12:32,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-21 18:12:32,144 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-21 18:12:32,144 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-21 18:12:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:32,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-21 18:12:32,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:32,705 INFO L387 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-21 18:12:32,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,723 INFO L387 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-21 18:12:32,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,736 INFO L387 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-21 18:12:32,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,767 INFO L387 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-21 18:12:32,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,798 INFO L387 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-21 18:12:32,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,823 INFO L387 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-21 18:12:32,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,846 INFO L387 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-21 18:12:32,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,868 INFO L387 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-21 18:12:32,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,894 INFO L387 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-21 18:12:32,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,930 INFO L387 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-21 18:12:32,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:32,968 INFO L387 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-21 18:12:33,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,011 INFO L387 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-21 18:12:33,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,030 INFO L387 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-21 18:12:33,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,049 INFO L387 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-21 18:12:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,069 INFO L387 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-21 18:12:33,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,086 INFO L387 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-21 18:12:33,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:33,173 INFO L387 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-21 18:12:36,256 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 (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2483)))) is different from true [2021-12-21 18:12:36,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:36,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:36,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:12:36,270 INFO L387 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-21 18:12:36,377 INFO L387 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-21 18:12:36,482 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:12:36,482 INFO L387 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-21 18:12:36,579 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-21 18:12:36,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:12:38,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [527898482] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:12:38,071 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:12:38,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 46 [2021-12-21 18:12:38,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550804509] [2021-12-21 18:12:38,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:12:38,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-21 18:12:38,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:38,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-21 18:12:38,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3299, Unknown=3, NotChecked=234, Total=3782 [2021-12-21 18:12:38,073 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-21 18:12:42,126 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 (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2483)))) (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2288 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2286) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2288)) |c_#memory_$Pointer$.base|))) is different from true [2021-12-21 18:12:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:43,216 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2021-12-21 18:12:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-21 18:12:43,217 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-21 18:12:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:43,217 INFO L225 Difference]: With dead ends: 140 [2021-12-21 18:12:43,217 INFO L226 Difference]: Without dead ends: 139 [2021-12-21 18:12:43,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=481, Invalid=5379, Unknown=4, NotChecked=456, Total=6320 [2021-12-21 18:12:43,219 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 174 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:12:43,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 934 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1304 Invalid, 0 Unknown, 251 Unchecked, 2.2s Time] [2021-12-21 18:12:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-21 18:12:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2021-12-21 18:12:43,221 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-21 18:12:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2021-12-21 18:12:43,222 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 59 [2021-12-21 18:12:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:43,222 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2021-12-21 18:12:43,222 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-21 18:12:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2021-12-21 18:12:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-21 18:12:43,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:43,222 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-21 18:12:43,231 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-21 18:12:43,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-21 18:12:43,628 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-21 18:12:43,628 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-21 18:12:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1066761989, now seen corresponding path program 1 times [2021-12-21 18:12:43,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:43,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365756865] [2021-12-21 18:12:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:43,629 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:43,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:43,630 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-21 18:12:43,631 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-21 18:12:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:43,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:12:43,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:43,937 INFO L387 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-21 18:12:44,261 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-21 18:12:44,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:44,261 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:44,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365756865] [2021-12-21 18:12:44,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365756865] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:44,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:44,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:12:44,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898429824] [2021-12-21 18:12:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:44,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:12:44,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:44,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:12:44,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:12:44,263 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-21 18:12:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:44,512 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-12-21 18:12:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 18:12:44,531 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-21 18:12:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:44,532 INFO L225 Difference]: With dead ends: 129 [2021-12-21 18:12:44,532 INFO L226 Difference]: Without dead ends: 129 [2021-12-21 18:12:44,532 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-21 18:12:44,533 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-21 18:12:44,533 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-21 18:12:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-21 18:12:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2021-12-21 18:12:44,535 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-21 18:12:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2021-12-21 18:12:44,536 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 62 [2021-12-21 18:12:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:44,536 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2021-12-21 18:12:44,536 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-21 18:12:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2021-12-21 18:12:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-21 18:12:44,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:44,537 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-21 18:12:44,561 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-21 18:12:44,746 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-21 18:12:44,746 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-21 18:12:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:44,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1335956715, now seen corresponding path program 1 times [2021-12-21 18:12:44,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:44,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152470862] [2021-12-21 18:12:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:44,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:44,748 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-21 18:12:44,749 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-21 18:12:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:45,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:12:45,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:45,145 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-21 18:12:45,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:45,145 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:45,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152470862] [2021-12-21 18:12:45,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152470862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:45,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:45,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:12:45,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666713095] [2021-12-21 18:12:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:45,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:12:45,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:12:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:12:45,147 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-21 18:12:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:45,221 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2021-12-21 18:12:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:12:45,221 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-21 18:12:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:45,222 INFO L225 Difference]: With dead ends: 129 [2021-12-21 18:12:45,222 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 18:12:45,222 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-21 18:12:45,223 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-21 18:12:45,223 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-21 18:12:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 18:12:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-21 18:12:45,225 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-21 18:12:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2021-12-21 18:12:45,225 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 63 [2021-12-21 18:12:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:45,226 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2021-12-21 18:12:45,226 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-21 18:12:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2021-12-21 18:12:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-21 18:12:45,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:45,226 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-21 18:12:45,239 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-21 18:12:45,436 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-21 18:12:45,436 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-21 18:12:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836323, now seen corresponding path program 1 times [2021-12-21 18:12:45,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:45,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332873315] [2021-12-21 18:12:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:45,437 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:45,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:45,438 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-21 18:12:45,440 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-21 18:12:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:45,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 18:12:45,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:45,741 INFO L387 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-21 18:12:45,924 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-21 18:12:45,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:12:46,116 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-21 18:12:46,116 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:46,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332873315] [2021-12-21 18:12:46,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332873315] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:12:46,116 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:12:46,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2021-12-21 18:12:46,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273970586] [2021-12-21 18:12:46,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:12:46,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 18:12:46,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 18:12:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-21 18:12:46,117 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-21 18:12:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:46,375 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-12-21 18:12:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 18:12:46,376 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-21 18:12:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:46,376 INFO L225 Difference]: With dead ends: 127 [2021-12-21 18:12:46,376 INFO L226 Difference]: Without dead ends: 127 [2021-12-21 18:12:46,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:12:46,377 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-21 18:12:46,377 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-21 18:12:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-21 18:12:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2021-12-21 18:12:46,379 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-21 18:12:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2021-12-21 18:12:46,380 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 66 [2021-12-21 18:12:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:46,380 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2021-12-21 18:12:46,380 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-21 18:12:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2021-12-21 18:12:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-21 18:12:46,381 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:46,381 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-21 18:12:46,393 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-21 18:12:46,591 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-21 18:12:46,591 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-21 18:12:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836322, now seen corresponding path program 1 times [2021-12-21 18:12:46,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:46,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551215251] [2021-12-21 18:12:46,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:46,592 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:46,593 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-21 18:12:46,596 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-21 18:12:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:46,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-21 18:12:46,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:46,916 INFO L387 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-21 18:12:47,342 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-21 18:12:47,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:47,342 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:47,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551215251] [2021-12-21 18:12:47,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551215251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:47,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:47,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-21 18:12:47,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761775544] [2021-12-21 18:12:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:47,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:12:47,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:47,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:12:47,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:12:47,343 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-21 18:12:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:47,610 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2021-12-21 18:12:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 18:12:47,611 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-21 18:12:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:47,611 INFO L225 Difference]: With dead ends: 129 [2021-12-21 18:12:47,611 INFO L226 Difference]: Without dead ends: 129 [2021-12-21 18:12:47,611 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-21 18:12:47,612 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:12:47,612 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.1s Time] [2021-12-21 18:12:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-21 18:12:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2021-12-21 18:12:47,614 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-21 18:12:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2021-12-21 18:12:47,614 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 66 [2021-12-21 18:12:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:47,615 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2021-12-21 18:12:47,615 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-21 18:12:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2021-12-21 18:12:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-21 18:12:47,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:47,615 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-21 18:12:47,628 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-21 18:12:47,823 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-21 18:12:47,823 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-21 18:12:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1739148477, now seen corresponding path program 1 times [2021-12-21 18:12:47,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:47,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880115389] [2021-12-21 18:12:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:47,824 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:47,825 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-21 18:12:47,825 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-21 18:12:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 18:12:48,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:48,295 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-21 18:12:48,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:48,295 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:48,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880115389] [2021-12-21 18:12:48,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880115389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:48,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:48,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:12:48,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058521471] [2021-12-21 18:12:48,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:48,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:12:48,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:48,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:12:48,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:12:48,300 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-21 18:12:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:48,430 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-12-21 18:12:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 18:12:48,430 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-21 18:12:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:48,431 INFO L225 Difference]: With dead ends: 125 [2021-12-21 18:12:48,431 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 18:12:48,431 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-21 18:12:48,432 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-21 18:12:48,432 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-21 18:12:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 18:12:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-21 18:12:48,434 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-21 18:12:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2021-12-21 18:12:48,434 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 68 [2021-12-21 18:12:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:48,434 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2021-12-21 18:12:48,434 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-21 18:12:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2021-12-21 18:12:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-21 18:12:48,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:48,435 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-21 18:12:48,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-12-21 18:12:48,635 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-21 18:12:48,635 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-21 18:12:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1920971938, now seen corresponding path program 1 times [2021-12-21 18:12:48,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:48,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135740245] [2021-12-21 18:12:48,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:48,636 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:48,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:48,637 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-21 18:12:48,637 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-21 18:12:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:12:48,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-21 18:12:48,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:12:49,439 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-21 18:12:49,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:12:49,440 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:12:49,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135740245] [2021-12-21 18:12:49,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135740245] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:12:49,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:12:49,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:12:49,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701721548] [2021-12-21 18:12:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:12:49,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:12:49,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:12:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:12:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:12:49,441 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-21 18:12:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:12:49,671 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2021-12-21 18:12:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 18:12:49,671 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-21 18:12:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:12:49,673 INFO L225 Difference]: With dead ends: 138 [2021-12-21 18:12:49,673 INFO L226 Difference]: Without dead ends: 138 [2021-12-21 18:12:49,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-12-21 18:12:49,673 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-21 18:12:49,673 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-21 18:12:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-21 18:12:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2021-12-21 18:12:49,675 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-21 18:12:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2021-12-21 18:12:49,676 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 69 [2021-12-21 18:12:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:12:49,676 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2021-12-21 18:12:49,676 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-21 18:12:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2021-12-21 18:12:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-21 18:12:49,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:12:49,677 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-21 18:12:49,693 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-21 18:12:49,893 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-21 18:12:49,893 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-21 18:12:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:12:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295794, now seen corresponding path program 1 times [2021-12-21 18:12:49,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:12:49,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10178048] [2021-12-21 18:12:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:12:49,894 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:12:49,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:12:49,895 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-21 18:12:49,896 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-21 18:12:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:12:50,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 18:12:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:12:50,551 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-21 18:12:50,552 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 18:12:50,552 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_kobject_putErr0REQUIRES_VIOLATION (20 of 21 remaining) [2021-12-21 18:12:50,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2021-12-21 18:12:50,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2021-12-21 18:12:50,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (17 of 21 remaining) [2021-12-21 18:12:50,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (16 of 21 remaining) [2021-12-21 18:12:50,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (15 of 21 remaining) [2021-12-21 18:12:50,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (14 of 21 remaining) [2021-12-21 18:12:50,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION (13 of 21 remaining) [2021-12-21 18:12:50,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION (12 of 21 remaining) [2021-12-21 18:12:50,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION (11 of 21 remaining) [2021-12-21 18:12:50,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATION (10 of 21 remaining) [2021-12-21 18:12:50,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATION (9 of 21 remaining) [2021-12-21 18:12:50,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATION (8 of 21 remaining) [2021-12-21 18:12:50,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATION (7 of 21 remaining) [2021-12-21 18:12:50,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATION (6 of 21 remaining) [2021-12-21 18:12:50,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2021-12-21 18:12:50,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2021-12-21 18:12:50,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2021-12-21 18:12:50,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2021-12-21 18:12:50,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2021-12-21 18:12:50,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 21 remaining) [2021-12-21 18:12:50,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-12-21 18:12:50,769 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-21 18:12:50,771 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-21 18:12:50,773 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 18:12:50,779 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,780 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,780 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,780 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,781 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,781 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,781 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,781 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,781 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,781 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,781 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,782 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,782 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,782 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,782 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,782 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,782 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,783 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,783 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,783 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,783 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,783 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,783 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,783 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,784 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,784 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,784 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,784 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,784 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,784 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,785 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,785 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,785 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,785 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,785 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,786 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,786 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,786 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,786 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,786 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,786 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,787 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,787 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,787 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,787 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,787 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,787 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,788 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,788 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,788 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,788 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,788 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,788 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,789 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,789 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,789 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,789 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,789 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,789 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,790 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,790 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,790 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,790 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,790 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,791 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,791 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,791 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,791 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,791 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,792 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,792 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,792 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,792 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,792 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,792 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,793 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,798 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,798 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,798 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,798 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,798 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,799 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,799 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,799 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 06:12:50 BoogieIcfgContainer [2021-12-21 18:12:50,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 18:12:50,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 18:12:50,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 18:12:50,824 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 18:12:50,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:11:47" (3/4) ... [2021-12-21 18:12:50,826 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,831 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,832 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,833 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,833 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,833 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,833 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,847 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,847 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,847 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:12:50,847 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:12:50,899 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 18:12:50,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 18:12:50,900 INFO L158 Benchmark]: Toolchain (without parser) took 64365.17ms. Allocated memory was 54.5MB in the beginning and 96.5MB in the end (delta: 41.9MB). Free memory was 30.4MB in the beginning and 44.3MB in the end (delta: -13.9MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2021-12-21 18:12:50,900 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.6MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:12:50,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.04ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 30.1MB in the beginning and 40.6MB in the end (delta: -10.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-21 18:12:50,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.87ms. Allocated memory is still 75.5MB. Free memory was 40.6MB in the beginning and 54.5MB in the end (delta: -13.9MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2021-12-21 18:12:50,900 INFO L158 Benchmark]: Boogie Preprocessor took 50.35ms. Allocated memory is still 75.5MB. Free memory was 54.5MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:12:50,900 INFO L158 Benchmark]: RCFGBuilder took 421.60ms. Allocated memory is still 75.5MB. Free memory was 52.4MB in the beginning and 34.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-21 18:12:50,901 INFO L158 Benchmark]: TraceAbstraction took 63243.66ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 34.1MB in the beginning and 53.9MB in the end (delta: -19.7MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2021-12-21 18:12:50,901 INFO L158 Benchmark]: Witness Printer took 75.16ms. Allocated memory is still 96.5MB. Free memory was 53.9MB in the beginning and 44.3MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 18:12:50,906 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.6MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.04ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 30.1MB in the beginning and 40.6MB in the end (delta: -10.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.87ms. Allocated memory is still 75.5MB. Free memory was 40.6MB in the beginning and 54.5MB in the end (delta: -13.9MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.35ms. Allocated memory is still 75.5MB. Free memory was 54.5MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 421.60ms. Allocated memory is still 75.5MB. Free memory was 52.4MB in the beginning and 34.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 63243.66ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 34.1MB in the beginning and 53.9MB in the end (delta: -19.7MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Witness Printer took 75.16ms. Allocated memory is still 96.5MB. Free memory was 53.9MB in the beginning and 44.3MB in the end (delta: 9.6MB). 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_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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.1s, OverallIterations: 34, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2061 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2035 mSDsluCounter, 14373 SdHoareTripleChecker+Invalid, 6.9s 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, 1261 SyntacticMatches, 42 SemanticMatches, 522 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3972 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.3s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1581 ConstructedInterpolants, 139 QuantifiedInterpolants, 9899 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-21 18:12:50,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)