./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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_test23_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:28:26,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:28:26,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:28:26,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:28:26,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:28:26,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:28:26,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:28:26,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:28:26,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:28:26,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:28:26,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:28:26,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:28:26,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:28:26,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:28:26,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:28:26,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:28:26,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:28:26,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:28:26,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:28:26,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:28:26,323 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:28:26,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:28:26,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:28:26,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:28:26,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:28:26,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:28:26,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:28:26,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:28:26,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:28:26,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:28:26,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:28:26,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:28:26,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:28:26,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:28:26,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:28:26,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:28:26,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:28:26,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:28:26,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:28:26,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:28:26,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:28:26,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:28:26,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:28:26,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:28:26,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:28:26,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:28:26,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:28:26,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:28:26,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:28:26,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:28:26,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:28:26,395 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:28:26,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:28:26,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:28:26,396 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:28:26,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:28:26,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:28:26,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:28:26,397 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:28:26,397 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:28:26,397 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:28:26,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:28:26,397 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:28:26,398 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:28:26,398 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:28:26,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:28:26,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:28:26,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:28:26,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:28:26,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:28:26,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:28:26,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:28:26,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:28:26,400 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2022-07-21 17:28:26,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:28:26,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:28:26,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:28:26,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:28:26,779 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:28:26,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2022-07-21 17:28:26,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0036ffcb2/1b5cea04ee624f2ebe0a85fc585d36a9/FLAG73d954304 [2022-07-21 17:28:27,452 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:28:27,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2022-07-21 17:28:27,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0036ffcb2/1b5cea04ee624f2ebe0a85fc585d36a9/FLAG73d954304 [2022-07-21 17:28:27,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0036ffcb2/1b5cea04ee624f2ebe0a85fc585d36a9 [2022-07-21 17:28:27,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:28:27,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:28:27,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:28:27,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:28:27,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:28:27,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:28:27" (1/1) ... [2022-07-21 17:28:27,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4a8f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:27, skipping insertion in model container [2022-07-21 17:28:27,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:28:27" (1/1) ... [2022-07-21 17:28:27,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:28:27,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:28:28,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:28:28,301 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions. at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.getConstantFirstDimensionOfArray(CTranslationUtil.java:210) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.constructIndexToInitInfo(InitializationHandler.java:1272) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.constructInitializerInfo(InitializationHandler.java:1228) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:207) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:806) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:212) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:628) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 17:28:28,307 INFO L158 Benchmark]: Toolchain (without parser) took 449.52ms. Allocated memory is still 58.7MB. Free memory was 36.3MB in the beginning and 38.6MB in the end (delta: -2.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 17:28:28,309 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:28:28,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.99ms. Allocated memory is still 58.7MB. Free memory was 36.1MB in the beginning and 38.6MB in the end (delta: -2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 17:28:28,312 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.99ms. Allocated memory is still 58.7MB. Free memory was 36.1MB in the beginning and 38.6MB in the end (delta: -2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions. de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions.: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.getConstantFirstDimensionOfArray(CTranslationUtil.java:210) 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_test23_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:28:30,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:28:30,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:28:30,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:28:30,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:28:30,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:28:30,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:28:30,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:28:30,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:28:30,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:28:30,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:28:30,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:28:30,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:28:30,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:28:30,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:28:30,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:28:30,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:28:30,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:28:30,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:28:30,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:28:30,129 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:28:30,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:28:30,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:28:30,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:28:30,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:28:30,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:28:30,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:28:30,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:28:30,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:28:30,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:28:30,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:28:30,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:28:30,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:28:30,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:28:30,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:28:30,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:28:30,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:28:30,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:28:30,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:28:30,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:28:30,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:28:30,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:28:30,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:28:30,183 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:28:30,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:28:30,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:28:30,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:28:30,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:28:30,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:28:30,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:28:30,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:28:30,186 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:28:30,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:28:30,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:28:30,188 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:28:30,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:28:30,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:28:30,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:28:30,188 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:28:30,196 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:28:30,196 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:28:30,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:28:30,196 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:28:30,196 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:28:30,197 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:28:30,197 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:28:30,197 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:28:30,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:28:30,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:28:30,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:28:30,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:28:30,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:28:30,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:28:30,199 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:28:30,199 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:28:30,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:28:30,199 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2022-07-21 17:28:30,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:28:30,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:28:30,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:28:30,570 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:28:30,571 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:28:30,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2022-07-21 17:28:30,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7774934b/0442025ed81347c0990d77bc22da6a42/FLAGa8ff27cf0 [2022-07-21 17:28:31,197 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:28:31,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2022-07-21 17:28:31,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7774934b/0442025ed81347c0990d77bc22da6a42/FLAGa8ff27cf0 [2022-07-21 17:28:31,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7774934b/0442025ed81347c0990d77bc22da6a42 [2022-07-21 17:28:31,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:28:31,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:28:31,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:28:31,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:28:31,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:28:31,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:28:31" (1/1) ... [2022-07-21 17:28:31,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10aaf9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:31, skipping insertion in model container [2022-07-21 17:28:31,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:28:31" (1/1) ... [2022-07-21 17:28:31,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:28:31,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:28:32,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:28:32,139 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 17:28:32,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:28:32,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:28:32,213 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:28:32,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:28:32,331 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:28:32,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32 WrapperNode [2022-07-21 17:28:32,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:28:32,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:28:32,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:28:32,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:28:32,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,429 INFO L137 Inliner]: procedures = 175, calls = 119, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 195 [2022-07-21 17:28:32,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:28:32,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:28:32,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:28:32,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:28:32,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:28:32,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:28:32,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:28:32,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:28:32,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (1/1) ... [2022-07-21 17:28:32,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:28:32,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:28:32,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 17:28:32,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 17:28:32,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 17:28:32,591 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-21 17:28:32,591 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-21 17:28:32,591 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-21 17:28:32,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-21 17:28:32,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 17:28:32,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 17:28:32,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:28:32,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:28:32,594 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2022-07-21 17:28:32,594 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2022-07-21 17:28:32,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:28:32,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:28:32,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:28:32,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 17:28:32,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:28:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:28:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2022-07-21 17:28:32,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2022-07-21 17:28:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 17:28:32,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 17:28:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:28:32,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:28:32,774 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:28:32,792 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:28:33,505 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:28:33,514 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:28:33,514 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 17:28:33,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:28:33 BoogieIcfgContainer [2022-07-21 17:28:33,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:28:33,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:28:33,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:28:33,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:28:33,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:28:31" (1/3) ... [2022-07-21 17:28:33,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15480681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:28:33, skipping insertion in model container [2022-07-21 17:28:33,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:32" (2/3) ... [2022-07-21 17:28:33,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15480681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:28:33, skipping insertion in model container [2022-07-21 17:28:33,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:28:33" (3/3) ... [2022-07-21 17:28:33,526 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test23_2.i [2022-07-21 17:28:33,540 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:28:33,540 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2022-07-21 17:28:33,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:28:33,589 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39f2e848, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7614b56e [2022-07-21 17:28:33,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2022-07-21 17:28:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:28:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:28:33,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:33,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:33,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1281397623, now seen corresponding path program 1 times [2022-07-21 17:28:33,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:33,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708810852] [2022-07-21 17:28:33,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:33,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:33,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:33,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:33,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 17:28:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:33,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:28:33,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:33,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:33,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:33,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:33,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708810852] [2022-07-21 17:28:33,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708810852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:33,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:33,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302916607] [2022-07-21 17:28:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:33,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:28:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:28:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:33,926 INFO L87 Difference]: Start difference. First operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:34,652 INFO L93 Difference]: Finished difference Result 231 states and 247 transitions. [2022-07-21 17:28:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:28:34,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2022-07-21 17:28:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:34,663 INFO L225 Difference]: With dead ends: 231 [2022-07-21 17:28:34,663 INFO L226 Difference]: Without dead ends: 227 [2022-07-21 17:28:34,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:28:34,672 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 28 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:34,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 839 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 17:28:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-21 17:28:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2022-07-21 17:28:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.793103448275862) internal successors, (208), 194 states have internal predecessors, (208), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-21 17:28:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 227 transitions. [2022-07-21 17:28:34,719 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 227 transitions. Word has length 12 [2022-07-21 17:28:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:34,726 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 227 transitions. [2022-07-21 17:28:34,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 227 transitions. [2022-07-21 17:28:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:28:34,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:34,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:34,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 17:28:34,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:34,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:34,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1281397624, now seen corresponding path program 1 times [2022-07-21 17:28:34,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:34,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164994082] [2022-07-21 17:28:34,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:34,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:34,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 17:28:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:35,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 17:28:35,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:35,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:35,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:35,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:35,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164994082] [2022-07-21 17:28:35,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164994082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:35,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:35,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:28:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455408571] [2022-07-21 17:28:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:35,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:28:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:35,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:28:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:28:35,159 INFO L87 Difference]: Start difference. First operand 211 states and 227 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:35,917 INFO L93 Difference]: Finished difference Result 236 states and 251 transitions. [2022-07-21 17:28:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:28:35,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 12 [2022-07-21 17:28:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:35,921 INFO L225 Difference]: With dead ends: 236 [2022-07-21 17:28:35,921 INFO L226 Difference]: Without dead ends: 236 [2022-07-21 17:28:35,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:28:35,923 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 35 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:35,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1152 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 17:28:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-21 17:28:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 211. [2022-07-21 17:28:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.7758620689655173) internal successors, (206), 194 states have internal predecessors, (206), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-21 17:28:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2022-07-21 17:28:35,938 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 12 [2022-07-21 17:28:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:35,938 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2022-07-21 17:28:35,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2022-07-21 17:28:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:28:35,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:35,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:35,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:36,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:36,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:36,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1270759338, now seen corresponding path program 1 times [2022-07-21 17:28:36,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:36,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664522511] [2022-07-21 17:28:36,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:36,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:36,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:36,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 17:28:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:36,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:28:36,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:36,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:36,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664522511] [2022-07-21 17:28:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664522511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:36,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645184241] [2022-07-21 17:28:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:36,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:28:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:36,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:28:36,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:36,312 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:36,345 INFO L93 Difference]: Finished difference Result 223 states and 237 transitions. [2022-07-21 17:28:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:28:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 12 [2022-07-21 17:28:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:36,350 INFO L225 Difference]: With dead ends: 223 [2022-07-21 17:28:36,350 INFO L226 Difference]: Without dead ends: 223 [2022-07-21 17:28:36,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:36,353 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 20 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:36,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 836 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-21 17:28:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2022-07-21 17:28:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 186 states have internal predecessors, (198), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-21 17:28:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2022-07-21 17:28:36,374 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 12 [2022-07-21 17:28:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:36,375 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2022-07-21 17:28:36,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2022-07-21 17:28:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:28:36,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:36,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:36,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:36,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:36,585 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1281312215, now seen corresponding path program 1 times [2022-07-21 17:28:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:36,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055741135] [2022-07-21 17:28:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:36,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:36,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:36,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:36,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 17:28:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:36,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:28:36,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:36,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:36,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:36,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055741135] [2022-07-21 17:28:36,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055741135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:36,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:36,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:36,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871850565] [2022-07-21 17:28:36,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:36,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:28:36,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:36,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:28:36,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:36,680 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:36,719 INFO L93 Difference]: Finished difference Result 223 states and 236 transitions. [2022-07-21 17:28:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:28:36,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-21 17:28:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:36,721 INFO L225 Difference]: With dead ends: 223 [2022-07-21 17:28:36,722 INFO L226 Difference]: Without dead ends: 223 [2022-07-21 17:28:36,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:36,723 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 127 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:36,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 768 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-21 17:28:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2022-07-21 17:28:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 186 states have internal predecessors, (197), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-21 17:28:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2022-07-21 17:28:36,732 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 12 [2022-07-21 17:28:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:36,733 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2022-07-21 17:28:36,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2022-07-21 17:28:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:28:36,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:36,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:36,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:36,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:36,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:36,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1270844746, now seen corresponding path program 1 times [2022-07-21 17:28:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:36,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304361456] [2022-07-21 17:28:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:36,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:36,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:36,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:36,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 17:28:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:37,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:28:37,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:37,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:37,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:37,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304361456] [2022-07-21 17:28:37,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304361456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:37,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:37,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:37,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893839098] [2022-07-21 17:28:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:37,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:28:37,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:37,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:28:37,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:37,066 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:37,107 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2022-07-21 17:28:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:28:37,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-21 17:28:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:37,109 INFO L225 Difference]: With dead ends: 207 [2022-07-21 17:28:37,110 INFO L226 Difference]: Without dead ends: 207 [2022-07-21 17:28:37,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:37,111 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 110 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:37,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 720 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-21 17:28:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2022-07-21 17:28:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 188 states have internal predecessors, (199), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-21 17:28:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2022-07-21 17:28:37,119 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 12 [2022-07-21 17:28:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:37,119 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2022-07-21 17:28:37,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2022-07-21 17:28:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:28:37,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:37,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:37,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:37,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:37,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:37,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash -741461350, now seen corresponding path program 1 times [2022-07-21 17:28:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:37,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542939853] [2022-07-21 17:28:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:37,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:37,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:37,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:37,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 17:28:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:37,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:28:37,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:37,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:37,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:37,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542939853] [2022-07-21 17:28:37,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542939853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:37,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:37,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:28:37,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911692919] [2022-07-21 17:28:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:37,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:28:37,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:37,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:28:37,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:28:37,409 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:37,698 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2022-07-21 17:28:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:28:37,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2022-07-21 17:28:37,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:37,700 INFO L225 Difference]: With dead ends: 216 [2022-07-21 17:28:37,700 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 17:28:37,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:28:37,701 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 51 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:37,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 396 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:28:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 17:28:37,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2022-07-21 17:28:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.7706422018348624) internal successors, (193), 183 states have internal predecessors, (193), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:28:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2022-07-21 17:28:37,707 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 13 [2022-07-21 17:28:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:37,707 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2022-07-21 17:28:37,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:28:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2022-07-21 17:28:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:28:37,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:37,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:37,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 17:28:37,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:37,917 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash 980413121, now seen corresponding path program 1 times [2022-07-21 17:28:37,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:37,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742719360] [2022-07-21 17:28:37,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:37,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:37,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:37,920 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:37,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 17:28:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:38,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 17:28:38,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:38,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:38,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:28:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:38,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:38,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:38,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742719360] [2022-07-21 17:28:38,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742719360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:38,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:38,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:38,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373576910] [2022-07-21 17:28:38,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:38,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:28:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:28:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:28:38,193 INFO L87 Difference]: Start difference. First operand 198 states and 209 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:28:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:41,096 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2022-07-21 17:28:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:28:41,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-07-21 17:28:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:41,098 INFO L225 Difference]: With dead ends: 208 [2022-07-21 17:28:41,098 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 17:28:41,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2022-07-21 17:28:41,099 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 58 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:41,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 576 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 490 Invalid, 0 Unknown, 113 Unchecked, 0.8s Time] [2022-07-21 17:28:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 17:28:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197. [2022-07-21 17:28:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 109 states have (on average 1.761467889908257) internal successors, (192), 182 states have internal predecessors, (192), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:28:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 208 transitions. [2022-07-21 17:28:41,105 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 208 transitions. Word has length 16 [2022-07-21 17:28:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:41,105 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 208 transitions. [2022-07-21 17:28:41,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:28:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 208 transitions. [2022-07-21 17:28:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:28:41,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:41,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:41,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:41,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:41,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash 980413120, now seen corresponding path program 1 times [2022-07-21 17:28:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:41,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262527609] [2022-07-21 17:28:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:41,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:41,320 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:41,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 17:28:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:41,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:28:41,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:41,514 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:28:41,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:28:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:41,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:41,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:41,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262527609] [2022-07-21 17:28:41,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262527609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:41,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:41,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323737442] [2022-07-21 17:28:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:41,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:28:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:28:41,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:41,561 INFO L87 Difference]: Start difference. First operand 197 states and 208 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:28:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:42,195 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2022-07-21 17:28:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:28:42,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-07-21 17:28:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:42,197 INFO L225 Difference]: With dead ends: 249 [2022-07-21 17:28:42,197 INFO L226 Difference]: Without dead ends: 249 [2022-07-21 17:28:42,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:28:42,198 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 199 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:42,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 538 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 366 Invalid, 0 Unknown, 114 Unchecked, 0.6s Time] [2022-07-21 17:28:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-21 17:28:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 207. [2022-07-21 17:28:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 191 states have internal predecessors, (206), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-21 17:28:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2022-07-21 17:28:42,205 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 16 [2022-07-21 17:28:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:42,205 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2022-07-21 17:28:42,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:28:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2022-07-21 17:28:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:28:42,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:42,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:42,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:42,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:42,426 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1929045948, now seen corresponding path program 1 times [2022-07-21 17:28:42,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:42,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964076651] [2022-07-21 17:28:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:42,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:42,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:42,428 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:42,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 17:28:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:42,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:28:42,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:42,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:42,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:42,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:42,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964076651] [2022-07-21 17:28:42,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964076651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:42,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:42,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856682347] [2022-07-21 17:28:42,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:42,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:28:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:42,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:28:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:28:42,582 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:43,143 INFO L93 Difference]: Finished difference Result 262 states and 286 transitions. [2022-07-21 17:28:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:28:43,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-07-21 17:28:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:43,146 INFO L225 Difference]: With dead ends: 262 [2022-07-21 17:28:43,146 INFO L226 Difference]: Without dead ends: 262 [2022-07-21 17:28:43,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:43,147 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 69 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:43,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 643 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 17:28:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-21 17:28:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 234. [2022-07-21 17:28:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 147 states have (on average 1.7687074829931972) internal successors, (260), 218 states have internal predecessors, (260), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-21 17:28:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2022-07-21 17:28:43,155 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 25 [2022-07-21 17:28:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:43,155 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2022-07-21 17:28:43,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2022-07-21 17:28:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:28:43,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:43,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:43,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:43,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:43,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1929045947, now seen corresponding path program 1 times [2022-07-21 17:28:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:43,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219964803] [2022-07-21 17:28:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:43,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:43,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:43,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:43,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 17:28:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:43,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:28:43,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:43,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:43,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:43,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:43,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219964803] [2022-07-21 17:28:43,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219964803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:43,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:43,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052535832] [2022-07-21 17:28:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:43,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:28:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:28:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:28:43,574 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:44,328 INFO L93 Difference]: Finished difference Result 294 states and 321 transitions. [2022-07-21 17:28:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:28:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-07-21 17:28:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:44,331 INFO L225 Difference]: With dead ends: 294 [2022-07-21 17:28:44,331 INFO L226 Difference]: Without dead ends: 294 [2022-07-21 17:28:44,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:44,332 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 103 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:44,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 641 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 17:28:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-21 17:28:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 236. [2022-07-21 17:28:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.7466666666666666) internal successors, (262), 219 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2022-07-21 17:28:44,341 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 25 [2022-07-21 17:28:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:44,342 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2022-07-21 17:28:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2022-07-21 17:28:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:28:44,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:44,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:44,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-21 17:28:44,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:44,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1612783879, now seen corresponding path program 1 times [2022-07-21 17:28:44,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:44,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907495499] [2022-07-21 17:28:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:44,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:44,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:44,559 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:44,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 17:28:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:44,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:28:44,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:44,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:44,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:44,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907495499] [2022-07-21 17:28:44,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907495499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:44,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:44,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865077716] [2022-07-21 17:28:44,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:44,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:28:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:44,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:28:44,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:28:44,686 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:44,785 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2022-07-21 17:28:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:28:44,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-21 17:28:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:44,787 INFO L225 Difference]: With dead ends: 236 [2022-07-21 17:28:44,787 INFO L226 Difference]: Without dead ends: 236 [2022-07-21 17:28:44,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:44,787 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 118 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:44,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 824 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:28:44,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-21 17:28:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-07-21 17:28:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.74) internal successors, (261), 219 states have internal predecessors, (261), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2022-07-21 17:28:44,795 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 27 [2022-07-21 17:28:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:44,795 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2022-07-21 17:28:44,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2022-07-21 17:28:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:28:44,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:44,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:44,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:45,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:45,006 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash -405984592, now seen corresponding path program 1 times [2022-07-21 17:28:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:45,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535332533] [2022-07-21 17:28:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:45,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:45,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:45,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 17:28:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:45,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:28:45,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:45,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:45,211 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:28:45,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-21 17:28:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:45,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:45,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:45,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535332533] [2022-07-21 17:28:45,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535332533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:45,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:45,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:28:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853195238] [2022-07-21 17:28:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:45,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:28:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:45,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:28:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:28:45,264 INFO L87 Difference]: Start difference. First operand 236 states and 282 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:28:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:46,051 INFO L93 Difference]: Finished difference Result 248 states and 290 transitions. [2022-07-21 17:28:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:28:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-07-21 17:28:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:46,053 INFO L225 Difference]: With dead ends: 248 [2022-07-21 17:28:46,053 INFO L226 Difference]: Without dead ends: 248 [2022-07-21 17:28:46,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:28:46,054 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 197 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:46,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 542 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 17:28:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-21 17:28:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2022-07-21 17:28:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.6733333333333333) internal successors, (251), 214 states have internal predecessors, (251), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2022-07-21 17:28:46,072 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 33 [2022-07-21 17:28:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:46,072 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2022-07-21 17:28:46,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:28:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2022-07-21 17:28:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:28:46,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:46,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:46,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:46,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:46,288 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash -405984591, now seen corresponding path program 1 times [2022-07-21 17:28:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:46,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789835974] [2022-07-21 17:28:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:46,292 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:46,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 17:28:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:46,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 17:28:46,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:46,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:46,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:46,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:46,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:28:46,564 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:28:46,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-21 17:28:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:46,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:46,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:46,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789835974] [2022-07-21 17:28:46,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789835974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:46,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:46,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965700624] [2022-07-21 17:28:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:46,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:28:46,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:46,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:28:46,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:46,643 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:28:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:47,574 INFO L93 Difference]: Finished difference Result 308 states and 337 transitions. [2022-07-21 17:28:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:28:47,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-07-21 17:28:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:47,576 INFO L225 Difference]: With dead ends: 308 [2022-07-21 17:28:47,576 INFO L226 Difference]: Without dead ends: 308 [2022-07-21 17:28:47,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:28:47,577 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:47,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 548 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 502 Invalid, 0 Unknown, 150 Unchecked, 0.9s Time] [2022-07-21 17:28:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-21 17:28:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 231. [2022-07-21 17:28:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.64) internal successors, (246), 214 states have internal predecessors, (246), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2022-07-21 17:28:47,584 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 33 [2022-07-21 17:28:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:47,585 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2022-07-21 17:28:47,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:28:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2022-07-21 17:28:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:28:47,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:47,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:47,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:47,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:47,797 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash -60324907, now seen corresponding path program 1 times [2022-07-21 17:28:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:47,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868619459] [2022-07-21 17:28:47,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:47,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:47,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:47,800 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:47,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 17:28:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:47,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:28:47,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:48,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:48,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:48,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868619459] [2022-07-21 17:28:48,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868619459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:48,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:48,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:48,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919531125] [2022-07-21 17:28:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:48,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:28:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:28:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:28:48,352 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:28:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:48,380 INFO L93 Difference]: Finished difference Result 315 states and 355 transitions. [2022-07-21 17:28:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:28:48,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-07-21 17:28:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:48,383 INFO L225 Difference]: With dead ends: 315 [2022-07-21 17:28:48,383 INFO L226 Difference]: Without dead ends: 315 [2022-07-21 17:28:48,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:28:48,383 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 142 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:48,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 553 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-07-21 17:28:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-21 17:28:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 248. [2022-07-21 17:28:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 166 states have (on average 1.5903614457831325) internal successors, (264), 230 states have internal predecessors, (264), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 285 transitions. [2022-07-21 17:28:48,390 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 285 transitions. Word has length 36 [2022-07-21 17:28:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:48,391 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 285 transitions. [2022-07-21 17:28:48,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:28:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 285 transitions. [2022-07-21 17:28:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:28:48,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:48,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:48,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:48,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:48,602 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash -60324935, now seen corresponding path program 1 times [2022-07-21 17:28:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:48,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992887465] [2022-07-21 17:28:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:48,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:48,605 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:48,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 17:28:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:48,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:28:48,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:48,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:48,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:48,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992887465] [2022-07-21 17:28:48,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992887465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:48,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:48,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:28:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494379395] [2022-07-21 17:28:48,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:48,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:28:48,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:48,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:28:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:28:48,745 INFO L87 Difference]: Start difference. First operand 248 states and 285 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:48,768 INFO L93 Difference]: Finished difference Result 294 states and 335 transitions. [2022-07-21 17:28:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:28:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 36 [2022-07-21 17:28:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:48,771 INFO L225 Difference]: With dead ends: 294 [2022-07-21 17:28:48,771 INFO L226 Difference]: Without dead ends: 294 [2022-07-21 17:28:48,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:48,773 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 36 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:48,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 583 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-21 17:28:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 254. [2022-07-21 17:28:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 172 states have (on average 1.569767441860465) internal successors, (270), 236 states have internal predecessors, (270), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2022-07-21 17:28:48,782 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 36 [2022-07-21 17:28:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:48,783 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2022-07-21 17:28:48,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2022-07-21 17:28:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 17:28:48,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:48,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:48,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:48,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:48,994 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1290023480, now seen corresponding path program 1 times [2022-07-21 17:28:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:48,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955859289] [2022-07-21 17:28:48,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:48,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:48,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:48,996 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:48,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 17:28:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:49,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:28:49,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:49,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:49,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955859289] [2022-07-21 17:28:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955859289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:49,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:49,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:28:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518031449] [2022-07-21 17:28:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:49,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:28:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:49,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:28:49,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:28:49,112 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:49,134 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2022-07-21 17:28:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:28:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 40 [2022-07-21 17:28:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:49,136 INFO L225 Difference]: With dead ends: 277 [2022-07-21 17:28:49,136 INFO L226 Difference]: Without dead ends: 277 [2022-07-21 17:28:49,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:49,136 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 43 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:49,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 581 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-21 17:28:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2022-07-21 17:28:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 174 states have (on average 1.5632183908045978) internal successors, (272), 238 states have internal predecessors, (272), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 293 transitions. [2022-07-21 17:28:49,148 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 293 transitions. Word has length 40 [2022-07-21 17:28:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:49,150 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 293 transitions. [2022-07-21 17:28:49,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 293 transitions. [2022-07-21 17:28:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:28:49,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:49,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:49,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:49,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:49,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:49,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1533058511, now seen corresponding path program 1 times [2022-07-21 17:28:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:49,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188785540] [2022-07-21 17:28:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:49,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:49,365 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:49,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 17:28:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:49,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:28:49,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:49,647 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:28:49,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:28:49,863 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:28:49,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-21 17:28:49,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2022-07-21 17:28:50,024 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:28:50,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-21 17:28:50,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:50,435 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:28:50,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 28 [2022-07-21 17:28:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:50,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:50,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:50,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188785540] [2022-07-21 17:28:50,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188785540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:50,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:50,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 17:28:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071010333] [2022-07-21 17:28:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:50,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:28:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:28:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:28:50,698 INFO L87 Difference]: Start difference. First operand 256 states and 293 transitions. Second operand has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:28:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:51,154 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2022-07-21 17:28:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:28:51,155 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-07-21 17:28:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:51,156 INFO L225 Difference]: With dead ends: 268 [2022-07-21 17:28:51,156 INFO L226 Difference]: Without dead ends: 268 [2022-07-21 17:28:51,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:28:51,157 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 19 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:51,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1553 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 526 Unchecked, 0.4s Time] [2022-07-21 17:28:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-21 17:28:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2022-07-21 17:28:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 182 states have (on average 1.5494505494505495) internal successors, (282), 246 states have internal predecessors, (282), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 303 transitions. [2022-07-21 17:28:51,162 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 303 transitions. Word has length 42 [2022-07-21 17:28:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:51,162 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 303 transitions. [2022-07-21 17:28:51,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:28:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 303 transitions. [2022-07-21 17:28:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:28:51,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:51,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:51,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:51,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:51,375 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1533058512, now seen corresponding path program 1 times [2022-07-21 17:28:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:51,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927595805] [2022-07-21 17:28:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:51,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:51,377 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:51,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 17:28:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:51,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 17:28:51,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:51,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:51,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:28:51,704 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:28:51,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:28:51,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:51,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:28:52,049 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:28:52,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:28:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:52,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:52,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:52,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927595805] [2022-07-21 17:28:52,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927595805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:52,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:52,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:28:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031112422] [2022-07-21 17:28:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:52,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:28:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:28:52,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:28:52,209 INFO L87 Difference]: Start difference. First operand 264 states and 303 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:28:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:53,342 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2022-07-21 17:28:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:28:53,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-07-21 17:28:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:53,344 INFO L225 Difference]: With dead ends: 272 [2022-07-21 17:28:53,344 INFO L226 Difference]: Without dead ends: 272 [2022-07-21 17:28:53,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:28:53,345 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 293 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:53,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 730 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 670 Invalid, 0 Unknown, 276 Unchecked, 1.0s Time] [2022-07-21 17:28:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-21 17:28:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2022-07-21 17:28:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 182 states have (on average 1.532967032967033) internal successors, (279), 244 states have internal predecessors, (279), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 300 transitions. [2022-07-21 17:28:53,355 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 300 transitions. Word has length 42 [2022-07-21 17:28:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:53,355 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 300 transitions. [2022-07-21 17:28:53,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:28:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 300 transitions. [2022-07-21 17:28:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:28:53,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:53,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:53,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:53,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:53,570 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -974113632, now seen corresponding path program 1 times [2022-07-21 17:28:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:53,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405871737] [2022-07-21 17:28:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:53,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:53,573 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:53,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 17:28:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:53,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 17:28:53,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:53,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2022-07-21 17:28:53,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2022-07-21 17:28:53,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:53,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2022-07-21 17:28:54,048 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-21 17:28:54,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 50 [2022-07-21 17:28:54,067 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-21 17:28:54,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 14 [2022-07-21 17:28:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:54,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:54,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:54,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405871737] [2022-07-21 17:28:54,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405871737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:54,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:54,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695233270] [2022-07-21 17:28:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:54,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:28:54,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:28:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:28:54,081 INFO L87 Difference]: Start difference. First operand 262 states and 300 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:54,314 INFO L93 Difference]: Finished difference Result 270 states and 308 transitions. [2022-07-21 17:28:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:28:54,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 43 [2022-07-21 17:28:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:54,316 INFO L225 Difference]: With dead ends: 270 [2022-07-21 17:28:54,316 INFO L226 Difference]: Without dead ends: 270 [2022-07-21 17:28:54,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:54,317 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 28 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:54,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 863 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2022-07-21 17:28:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-21 17:28:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 261. [2022-07-21 17:28:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 182 states have (on average 1.521978021978022) internal successors, (277), 243 states have internal predecessors, (277), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 298 transitions. [2022-07-21 17:28:54,322 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 298 transitions. Word has length 43 [2022-07-21 17:28:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:54,323 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 298 transitions. [2022-07-21 17:28:54,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions. [2022-07-21 17:28:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:28:54,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:54,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:54,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:54,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:54,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash 280193697, now seen corresponding path program 1 times [2022-07-21 17:28:54,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:54,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328269363] [2022-07-21 17:28:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:54,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:54,527 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:54,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 17:28:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:54,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:28:54,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:54,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:54,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:54,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328269363] [2022-07-21 17:28:54,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328269363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:54,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:54,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:28:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391194236] [2022-07-21 17:28:54,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:54,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:28:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:54,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:28:54,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:28:54,673 INFO L87 Difference]: Start difference. First operand 261 states and 298 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:54,694 INFO L93 Difference]: Finished difference Result 283 states and 319 transitions. [2022-07-21 17:28:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:28:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 43 [2022-07-21 17:28:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:54,696 INFO L225 Difference]: With dead ends: 283 [2022-07-21 17:28:54,696 INFO L226 Difference]: Without dead ends: 283 [2022-07-21 17:28:54,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:54,697 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 48 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:54,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 561 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-21 17:28:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2022-07-21 17:28:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 184 states have (on average 1.5108695652173914) internal successors, (278), 245 states have internal predecessors, (278), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 299 transitions. [2022-07-21 17:28:54,702 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 299 transitions. Word has length 43 [2022-07-21 17:28:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:54,703 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 299 transitions. [2022-07-21 17:28:54,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 299 transitions. [2022-07-21 17:28:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:28:54,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:54,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:54,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:54,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:54,914 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash -132751331, now seen corresponding path program 1 times [2022-07-21 17:28:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:54,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209625190] [2022-07-21 17:28:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:54,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:54,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:54,916 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:54,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 17:28:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:55,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:28:55,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:55,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:55,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:55,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:55,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209625190] [2022-07-21 17:28:55,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209625190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:55,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:55,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555013733] [2022-07-21 17:28:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:55,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:28:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:28:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:55,176 INFO L87 Difference]: Start difference. First operand 263 states and 299 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:55,855 INFO L93 Difference]: Finished difference Result 311 states and 340 transitions. [2022-07-21 17:28:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:28:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-21 17:28:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:55,858 INFO L225 Difference]: With dead ends: 311 [2022-07-21 17:28:55,858 INFO L226 Difference]: Without dead ends: 311 [2022-07-21 17:28:55,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:28:55,859 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 126 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:55,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 818 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 17:28:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-21 17:28:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2022-07-21 17:28:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 184 states have (on average 1.4945652173913044) internal successors, (275), 244 states have internal predecessors, (275), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 296 transitions. [2022-07-21 17:28:55,865 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 296 transitions. Word has length 44 [2022-07-21 17:28:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:55,866 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 296 transitions. [2022-07-21 17:28:55,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 296 transitions. [2022-07-21 17:28:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:28:55,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:55,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:55,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-21 17:28:56,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:56,079 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash -132751330, now seen corresponding path program 1 times [2022-07-21 17:28:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:56,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157439356] [2022-07-21 17:28:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:56,082 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:56,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-21 17:28:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:56,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:28:56,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:56,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:56,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:56,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:56,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157439356] [2022-07-21 17:28:56,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157439356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:56,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:56,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079143134] [2022-07-21 17:28:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:56,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:28:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:56,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:28:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:56,418 INFO L87 Difference]: Start difference. First operand 262 states and 296 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:57,135 INFO L93 Difference]: Finished difference Result 331 states and 359 transitions. [2022-07-21 17:28:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:28:57,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-21 17:28:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:57,141 INFO L225 Difference]: With dead ends: 331 [2022-07-21 17:28:57,141 INFO L226 Difference]: Without dead ends: 331 [2022-07-21 17:28:57,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:28:57,142 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 142 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:57,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 840 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 17:28:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-21 17:28:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 262. [2022-07-21 17:28:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 184 states have (on average 1.483695652173913) internal successors, (273), 244 states have internal predecessors, (273), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-21 17:28:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 294 transitions. [2022-07-21 17:28:57,149 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 294 transitions. Word has length 44 [2022-07-21 17:28:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:57,149 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 294 transitions. [2022-07-21 17:28:57,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:28:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 294 transitions. [2022-07-21 17:28:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:28:57,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:57,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:57,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:57,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:57,364 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:28:57,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1335876523, now seen corresponding path program 1 times [2022-07-21 17:28:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:57,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702866454] [2022-07-21 17:28:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:57,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:57,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:57,366 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:57,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-21 17:28:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:57,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 17:28:57,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:57,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:28:57,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:28:57,761 INFO L356 Elim1Store]: treesize reduction 54, result has 37.9 percent of original size [2022-07-21 17:28:57,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 47 [2022-07-21 17:28:57,812 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 17:28:57,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 11 [2022-07-21 17:28:58,113 INFO L356 Elim1Store]: treesize reduction 54, result has 37.9 percent of original size [2022-07-21 17:28:58,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 51 [2022-07-21 17:28:58,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-21 17:28:58,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-21 17:28:58,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:58,985 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 17:28:58,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2022-07-21 17:28:59,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 17:28:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:59,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:59,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:59,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702866454] [2022-07-21 17:28:59,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702866454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:59,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:59,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-21 17:28:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634196778] [2022-07-21 17:28:59,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:59,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 17:28:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:59,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 17:28:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:28:59,212 INFO L87 Difference]: Start difference. First operand 262 states and 294 transitions. Second operand has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:00,081 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2022-07-21 17:29:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:29:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 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 45 [2022-07-21 17:29:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:00,083 INFO L225 Difference]: With dead ends: 301 [2022-07-21 17:29:00,083 INFO L226 Difference]: Without dead ends: 301 [2022-07-21 17:29:00,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-07-21 17:29:00,084 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 85 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:00,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1318 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 511 Invalid, 0 Unknown, 509 Unchecked, 0.5s Time] [2022-07-21 17:29:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-21 17:29:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 271. [2022-07-21 17:29:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.486910994764398) internal successors, (284), 252 states have internal predecessors, (284), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 308 transitions. [2022-07-21 17:29:00,090 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 308 transitions. Word has length 45 [2022-07-21 17:29:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:00,090 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 308 transitions. [2022-07-21 17:29:00,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 308 transitions. [2022-07-21 17:29:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:29:00,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:00,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:00,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:00,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:00,291 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1335876522, now seen corresponding path program 1 times [2022-07-21 17:29:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:00,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686808267] [2022-07-21 17:29:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:00,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:00,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:00,294 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:00,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-21 17:29:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:00,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-21 17:29:00,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:00,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:29:00,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:29:00,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:00,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:00,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:29:01,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:01,026 INFO L356 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2022-07-21 17:29:01,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2022-07-21 17:29:01,136 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 17:29:01,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 9 [2022-07-21 17:29:01,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2022-07-21 17:29:01,510 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 17:29:01,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-21 17:29:01,544 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-21 17:29:01,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 17:29:02,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:02,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 17:29:02,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:02,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-21 17:29:02,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:29:02,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 17:29:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:02,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:02,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:02,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686808267] [2022-07-21 17:29:02,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686808267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:02,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:02,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-21 17:29:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227653185] [2022-07-21 17:29:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:02,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 17:29:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 17:29:02,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-07-21 17:29:02,951 INFO L87 Difference]: Start difference. First operand 271 states and 308 transitions. Second operand has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:03,389 INFO L93 Difference]: Finished difference Result 272 states and 308 transitions. [2022-07-21 17:29:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 17:29:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 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 45 [2022-07-21 17:29:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:03,391 INFO L225 Difference]: With dead ends: 272 [2022-07-21 17:29:03,391 INFO L226 Difference]: Without dead ends: 272 [2022-07-21 17:29:03,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-07-21 17:29:03,392 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 24 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:03,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1605 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 891 Unchecked, 0.3s Time] [2022-07-21 17:29:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-21 17:29:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2022-07-21 17:29:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.4816753926701571) internal successors, (283), 252 states have internal predecessors, (283), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 307 transitions. [2022-07-21 17:29:03,398 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 307 transitions. Word has length 45 [2022-07-21 17:29:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:03,398 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 307 transitions. [2022-07-21 17:29:03,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 307 transitions. [2022-07-21 17:29:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 17:29:03,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:03,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:03,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:03,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:03,599 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 417882070, now seen corresponding path program 1 times [2022-07-21 17:29:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:03,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812045416] [2022-07-21 17:29:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:03,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:03,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:03,601 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:03,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-21 17:29:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:03,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-21 17:29:03,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:03,971 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 17:29:03,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2022-07-21 17:29:04,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:04,401 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:29:04,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:29:04,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 17:29:04,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:04,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:04,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:04,826 INFO L356 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2022-07-21 17:29:04,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 58 [2022-07-21 17:29:04,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:29:05,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-07-21 17:29:05,385 INFO L356 Elim1Store]: treesize reduction 13, result has 68.3 percent of original size [2022-07-21 17:29:05,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 54 [2022-07-21 17:29:05,723 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:29:05,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 45 [2022-07-21 17:29:05,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:05,853 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:29:05,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 45 [2022-07-21 17:29:05,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:06,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:29:06,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:29:06,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2022-07-21 17:29:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:06,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:06,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:06,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812045416] [2022-07-21 17:29:06,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812045416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:06,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:06,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-07-21 17:29:06,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880516358] [2022-07-21 17:29:06,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:06,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 17:29:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 17:29:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-07-21 17:29:06,947 INFO L87 Difference]: Start difference. First operand 271 states and 307 transitions. Second operand has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:07,760 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2022-07-21 17:29:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 17:29:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 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 47 [2022-07-21 17:29:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:07,762 INFO L225 Difference]: With dead ends: 271 [2022-07-21 17:29:07,762 INFO L226 Difference]: Without dead ends: 271 [2022-07-21 17:29:07,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 17:29:07,763 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 16 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:07,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2147 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 371 Invalid, 0 Unknown, 716 Unchecked, 0.5s Time] [2022-07-21 17:29:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-21 17:29:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-07-21 17:29:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.4764397905759161) internal successors, (282), 252 states have internal predecessors, (282), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 306 transitions. [2022-07-21 17:29:07,768 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 306 transitions. Word has length 47 [2022-07-21 17:29:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:07,769 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 306 transitions. [2022-07-21 17:29:07,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 306 transitions. [2022-07-21 17:29:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 17:29:07,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:07,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:07,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:07,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:07,981 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting free_reportsErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 417882071, now seen corresponding path program 1 times [2022-07-21 17:29:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:07,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456828061] [2022-07-21 17:29:07,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:07,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:07,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:07,984 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:07,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-21 17:29:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:08,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-21 17:29:08,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:08,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:29:08,435 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:29:08,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:29:08,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:08,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:08,760 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:29:08,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:29:08,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:08,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:29:08,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 17:29:09,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 17:29:09,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:09,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:29:09,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:09,131 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:29:09,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2022-07-21 17:29:09,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-21 17:29:09,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-21 17:29:09,657 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 17:29:09,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-21 17:29:09,705 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-21 17:29:09,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2022-07-21 17:29:10,504 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:29:10,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 61 [2022-07-21 17:29:10,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:29:11,264 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 17:29:11,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 61 [2022-07-21 17:29:11,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:29:12,381 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:29:12,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2022-07-21 17:29:12,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:29:12,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2022-07-21 17:29:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:12,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:12,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456828061] [2022-07-21 17:29:12,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456828061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:12,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:12,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-07-21 17:29:12,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154236336] [2022-07-21 17:29:12,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:12,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 17:29:12,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:12,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 17:29:12,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-07-21 17:29:12,626 INFO L87 Difference]: Start difference. First operand 271 states and 306 transitions. Second operand has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:13,416 INFO L93 Difference]: Finished difference Result 271 states and 305 transitions. [2022-07-21 17:29:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 17:29:13,418 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 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 47 [2022-07-21 17:29:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:13,419 INFO L225 Difference]: With dead ends: 271 [2022-07-21 17:29:13,420 INFO L226 Difference]: Without dead ends: 271 [2022-07-21 17:29:13,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2022-07-21 17:29:13,420 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 13 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1087 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:13,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1804 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 179 Invalid, 0 Unknown, 1087 Unchecked, 0.4s Time] [2022-07-21 17:29:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-21 17:29:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-07-21 17:29:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.4712041884816753) internal successors, (281), 252 states have internal predecessors, (281), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2022-07-21 17:29:13,426 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 47 [2022-07-21 17:29:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:13,427 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2022-07-21 17:29:13,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2022-07-21 17:29:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 17:29:13,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:13,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:13,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-21 17:29:13,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:13,639 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:13,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash 870106982, now seen corresponding path program 1 times [2022-07-21 17:29:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:13,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296489036] [2022-07-21 17:29:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:13,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:13,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:13,641 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:13,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-21 17:29:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:14,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 17:29:14,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:14,115 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:29:14,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2022-07-21 17:29:14,312 INFO L356 Elim1Store]: treesize reduction 29, result has 50.0 percent of original size [2022-07-21 17:29:14,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 45 [2022-07-21 17:29:14,486 INFO L356 Elim1Store]: treesize reduction 84, result has 36.8 percent of original size [2022-07-21 17:29:14,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 39 treesize of output 76 [2022-07-21 17:29:14,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:15,028 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-21 17:29:15,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:15,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:15,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:15,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:15,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:15,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-21 17:29:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:16,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:16,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:16,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296489036] [2022-07-21 17:29:16,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296489036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:16,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:16,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-21 17:29:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468902316] [2022-07-21 17:29:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:16,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:29:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:29:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-21 17:29:16,527 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand has 20 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:17,066 INFO L93 Difference]: Finished difference Result 284 states and 320 transitions. [2022-07-21 17:29:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 17:29:17,067 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-07-21 17:29:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:17,068 INFO L225 Difference]: With dead ends: 284 [2022-07-21 17:29:17,068 INFO L226 Difference]: Without dead ends: 284 [2022-07-21 17:29:17,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:29:17,069 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 71 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 873 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:17,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1443 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 371 Invalid, 0 Unknown, 873 Unchecked, 0.4s Time] [2022-07-21 17:29:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-21 17:29:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2022-07-21 17:29:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 197 states have (on average 1.4619289340101522) internal successors, (288), 258 states have internal predecessors, (288), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 312 transitions. [2022-07-21 17:29:17,075 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 312 transitions. Word has length 47 [2022-07-21 17:29:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:17,075 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 312 transitions. [2022-07-21 17:29:17,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 312 transitions. [2022-07-21 17:29:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 17:29:17,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:17,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:17,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-21 17:29:17,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:17,290 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:17,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash 870106983, now seen corresponding path program 1 times [2022-07-21 17:29:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:17,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532503981] [2022-07-21 17:29:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:17,292 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:17,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-21 17:29:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:17,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-21 17:29:17,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:17,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:29:17,756 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:29:17,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-21 17:29:17,867 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:17,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:17,892 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:29:17,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-21 17:29:17,942 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:17,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-07-21 17:29:18,071 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:18,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-21 17:29:18,110 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-21 17:29:18,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:29:18,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:18,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:18,529 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-21 17:29:18,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:18,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:18,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:18,698 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:18,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:18,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:18,743 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:18,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:18,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:18,864 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:18,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:18,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:18,902 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:18,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:18,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:19,064 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:19,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:19,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:19,094 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:19,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:19,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:19,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:19,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:19,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:19,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:29:19,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:29:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:19,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:19,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:19,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532503981] [2022-07-21 17:29:19,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532503981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:19,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-21 17:29:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556440955] [2022-07-21 17:29:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:19,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 17:29:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:19,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 17:29:19,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:29:19,655 INFO L87 Difference]: Start difference. First operand 277 states and 312 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:21,283 INFO L93 Difference]: Finished difference Result 284 states and 319 transitions. [2022-07-21 17:29:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:29:21,283 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-07-21 17:29:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:21,284 INFO L225 Difference]: With dead ends: 284 [2022-07-21 17:29:21,285 INFO L226 Difference]: Without dead ends: 284 [2022-07-21 17:29:21,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 17:29:21,285 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 86 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 527 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:21,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1477 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 902 Invalid, 0 Unknown, 527 Unchecked, 1.1s Time] [2022-07-21 17:29:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-21 17:29:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2022-07-21 17:29:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 258 states have internal predecessors, (287), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 311 transitions. [2022-07-21 17:29:21,290 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 311 transitions. Word has length 47 [2022-07-21 17:29:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:21,291 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 311 transitions. [2022-07-21 17:29:21,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 311 transitions. [2022-07-21 17:29:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:29:21,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:21,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:21,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:21,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:21,512 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash -479935114, now seen corresponding path program 1 times [2022-07-21 17:29:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:21,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033189431] [2022-07-21 17:29:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:21,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:21,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:21,514 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:21,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-21 17:29:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:21,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:29:21,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:21,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:21,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033189431] [2022-07-21 17:29:21,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033189431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:21,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:21,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:29:21,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066494131] [2022-07-21 17:29:21,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:21,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:29:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:21,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:29:21,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:29:21,713 INFO L87 Difference]: Start difference. First operand 277 states and 311 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:29:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:21,728 INFO L93 Difference]: Finished difference Result 294 states and 326 transitions. [2022-07-21 17:29:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:29:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 49 [2022-07-21 17:29:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:21,729 INFO L225 Difference]: With dead ends: 294 [2022-07-21 17:29:21,729 INFO L226 Difference]: Without dead ends: 294 [2022-07-21 17:29:21,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:29:21,730 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 77 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:21,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 554 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:29:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-21 17:29:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 275. [2022-07-21 17:29:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 195 states have (on average 1.4461538461538461) internal successors, (282), 256 states have internal predecessors, (282), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 306 transitions. [2022-07-21 17:29:21,735 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 306 transitions. Word has length 49 [2022-07-21 17:29:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:21,736 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 306 transitions. [2022-07-21 17:29:21,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 17:29:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 306 transitions. [2022-07-21 17:29:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:29:21,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:21,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:21,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-21 17:29:21,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:21,949 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1345808633, now seen corresponding path program 1 times [2022-07-21 17:29:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:21,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127350179] [2022-07-21 17:29:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:21,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:21,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:21,951 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:21,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-21 17:29:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:22,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-21 17:29:22,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:22,709 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:29:22,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2022-07-21 17:29:22,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:22,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:22,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:22,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:22,937 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 17:29:22,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2022-07-21 17:29:23,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:23,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:23,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:23,011 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:29:23,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-21 17:29:23,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:23,239 INFO L356 Elim1Store]: treesize reduction 100, result has 36.3 percent of original size [2022-07-21 17:29:23,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 36 treesize of output 77 [2022-07-21 17:29:23,641 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 17:29:23,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2022-07-21 17:29:23,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:24,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-21 17:29:24,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,276 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:24,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 61 [2022-07-21 17:29:24,907 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:24,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:24,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:24,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:24,941 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:24,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:29:25,216 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:25,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:25,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:25,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:25,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:25,247 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:25,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:29:25,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:25,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:25,634 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:25,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:29:25,760 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:25,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 17:29:25,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:25,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:26,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:26,004 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:26,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 17:29:26,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:26,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:29:27,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:29:28,584 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-07-21 17:29:28,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 28 [2022-07-21 17:29:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:29,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:29,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:29,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127350179] [2022-07-21 17:29:29,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127350179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:29,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:29,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-21 17:29:29,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373412766] [2022-07-21 17:29:29,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:29,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 17:29:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 17:29:29,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:29:29,946 INFO L87 Difference]: Start difference. First operand 275 states and 306 transitions. Second operand has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:31,245 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2022-07-21 17:29:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 17:29:31,246 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2022-07-21 17:29:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:31,247 INFO L225 Difference]: With dead ends: 284 [2022-07-21 17:29:31,247 INFO L226 Difference]: Without dead ends: 284 [2022-07-21 17:29:31,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 17:29:31,248 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 71 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 924 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:31,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1577 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 663 Invalid, 0 Unknown, 924 Unchecked, 0.8s Time] [2022-07-21 17:29:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-21 17:29:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2022-07-21 17:29:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 197 states have (on average 1.4467005076142132) internal successors, (285), 258 states have internal predecessors, (285), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 309 transitions. [2022-07-21 17:29:31,253 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 309 transitions. Word has length 49 [2022-07-21 17:29:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:31,254 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 309 transitions. [2022-07-21 17:29:31,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 309 transitions. [2022-07-21 17:29:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:29:31,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:31,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:31,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:31,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:31,469 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1345808632, now seen corresponding path program 1 times [2022-07-21 17:29:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:31,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289042488] [2022-07-21 17:29:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:31,471 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:31,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-21 17:29:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:32,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-21 17:29:32,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:32,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:29:32,233 INFO L356 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2022-07-21 17:29:32,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 28 [2022-07-21 17:29:32,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:32,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:29:32,477 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 17:29:32,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-21 17:29:32,541 INFO L356 Elim1Store]: treesize reduction 81, result has 35.7 percent of original size [2022-07-21 17:29:32,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 66 [2022-07-21 17:29:32,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2022-07-21 17:29:32,646 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 17:29:32,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2022-07-21 17:29:32,907 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 17:29:32,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-21 17:29:32,948 INFO L356 Elim1Store]: treesize reduction 40, result has 34.4 percent of original size [2022-07-21 17:29:32,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 46 [2022-07-21 17:29:33,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-07-21 17:29:33,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 17:29:33,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,876 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:33,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 57 [2022-07-21 17:29:33,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-21 17:29:33,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:33,931 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:33,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 71 [2022-07-21 17:29:34,540 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-21 17:29:34,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 42 [2022-07-21 17:29:34,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:34,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,589 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:34,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-21 17:29:34,634 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:34,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2022-07-21 17:29:34,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 17:29:34,826 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:34,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2022-07-21 17:29:34,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 17:29:34,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,879 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:34,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-21 17:29:34,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:34,949 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-21 17:29:34,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2022-07-21 17:29:34,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 17:29:35,191 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:29:35,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2022-07-21 17:29:35,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 17:29:35,255 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-21 17:29:35,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 42 [2022-07-21 17:29:35,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,338 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:35,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-21 17:29:35,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,579 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:29:35,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-21 17:29:35,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-21 17:29:35,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:35,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-21 17:29:41,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2022-07-21 17:29:42,179 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-21 17:29:42,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 45 [2022-07-21 17:29:42,194 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:29:42,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-21 17:29:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:42,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:42,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:42,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289042488] [2022-07-21 17:29:42,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289042488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:42,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:42,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-21 17:29:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50336141] [2022-07-21 17:29:42,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:42,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 17:29:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 17:29:42,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-07-21 17:29:42,469 INFO L87 Difference]: Start difference. First operand 277 states and 309 transitions. Second operand has 29 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:43,301 INFO L93 Difference]: Finished difference Result 351 states and 392 transitions. [2022-07-21 17:29:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 17:29:43,302 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2022-07-21 17:29:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:43,303 INFO L225 Difference]: With dead ends: 351 [2022-07-21 17:29:43,303 INFO L226 Difference]: Without dead ends: 351 [2022-07-21 17:29:43,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 17:29:43,303 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 69 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1041 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:43,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2327 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 331 Invalid, 0 Unknown, 1041 Unchecked, 0.4s Time] [2022-07-21 17:29:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-21 17:29:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 301. [2022-07-21 17:29:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 221 states have (on average 1.411764705882353) internal successors, (312), 282 states have internal predecessors, (312), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-21 17:29:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 336 transitions. [2022-07-21 17:29:43,310 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 336 transitions. Word has length 49 [2022-07-21 17:29:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:43,310 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 336 transitions. [2022-07-21 17:29:43,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 336 transitions. [2022-07-21 17:29:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:29:43,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:43,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:43,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-21 17:29:43,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:43,524 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-21 17:29:43,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash 459629702, now seen corresponding path program 1 times [2022-07-21 17:29:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:43,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441748447] [2022-07-21 17:29:43,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:43,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:43,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:43,526 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) [2022-07-21 17:29:43,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-21 17:29:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:29:44,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 17:29:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:29:44,880 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-21 17:29:44,891 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 17:29:44,892 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 79 remaining) [2022-07-21 17:29:44,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 79 remaining) [2022-07-21 17:29:44,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 79 remaining) [2022-07-21 17:29:44,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 79 remaining) [2022-07-21 17:29:44,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 79 remaining) [2022-07-21 17:29:44,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr4ASSERT_VIOLATIONMEMORY_FREE (73 of 79 remaining) [2022-07-21 17:29:44,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr5ASSERT_VIOLATIONMEMORY_FREE (72 of 79 remaining) [2022-07-21 17:29:44,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr6ASSERT_VIOLATIONMEMORY_FREE (71 of 79 remaining) [2022-07-21 17:29:44,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 79 remaining) [2022-07-21 17:29:44,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 79 remaining) [2022-07-21 17:29:44,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 79 remaining) [2022-07-21 17:29:44,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 79 remaining) [2022-07-21 17:29:44,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 79 remaining) [2022-07-21 17:29:44,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 79 remaining) [2022-07-21 17:29:44,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 79 remaining) [2022-07-21 17:29:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 79 remaining) [2022-07-21 17:29:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 79 remaining) [2022-07-21 17:29:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 79 remaining) [2022-07-21 17:29:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 79 remaining) [2022-07-21 17:29:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 79 remaining) [2022-07-21 17:29:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 79 remaining) [2022-07-21 17:29:44,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 79 remaining) [2022-07-21 17:29:44,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 79 remaining) [2022-07-21 17:29:44,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 79 remaining) [2022-07-21 17:29:44,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 79 remaining) [2022-07-21 17:29:44,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 79 remaining) [2022-07-21 17:29:44,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 79 remaining) [2022-07-21 17:29:44,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 79 remaining) [2022-07-21 17:29:44,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 79 remaining) [2022-07-21 17:29:44,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 79 remaining) [2022-07-21 17:29:44,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 79 remaining) [2022-07-21 17:29:44,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 79 remaining) [2022-07-21 17:29:44,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 79 remaining) [2022-07-21 17:29:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 79 remaining) [2022-07-21 17:29:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 79 remaining) [2022-07-21 17:29:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 79 remaining) [2022-07-21 17:29:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 79 remaining) [2022-07-21 17:29:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 79 remaining) [2022-07-21 17:29:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 79 remaining) [2022-07-21 17:29:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 79 remaining) [2022-07-21 17:29:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 79 remaining) [2022-07-21 17:29:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 79 remaining) [2022-07-21 17:29:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 79 remaining) [2022-07-21 17:29:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 79 remaining) [2022-07-21 17:29:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 79 remaining) [2022-07-21 17:29:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 79 remaining) [2022-07-21 17:29:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX (32 of 79 remaining) [2022-07-21 17:29:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 79 remaining) [2022-07-21 17:29:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 79 remaining) [2022-07-21 17:29:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 79 remaining) [2022-07-21 17:29:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 79 remaining) [2022-07-21 17:29:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 79 remaining) [2022-07-21 17:29:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 79 remaining) [2022-07-21 17:29:44,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 79 remaining) [2022-07-21 17:29:44,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 79 remaining) [2022-07-21 17:29:44,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 79 remaining) [2022-07-21 17:29:44,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 79 remaining) [2022-07-21 17:29:44,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 79 remaining) [2022-07-21 17:29:44,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 79 remaining) [2022-07-21 17:29:44,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 79 remaining) [2022-07-21 17:29:44,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (18 of 79 remaining) [2022-07-21 17:29:44,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (17 of 79 remaining) [2022-07-21 17:29:44,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (16 of 79 remaining) [2022-07-21 17:29:44,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 79 remaining) [2022-07-21 17:29:44,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 79 remaining) [2022-07-21 17:29:44,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (13 of 79 remaining) [2022-07-21 17:29:44,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (12 of 79 remaining) [2022-07-21 17:29:44,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (11 of 79 remaining) [2022-07-21 17:29:44,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (10 of 79 remaining) [2022-07-21 17:29:44,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (9 of 79 remaining) [2022-07-21 17:29:44,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (8 of 79 remaining) [2022-07-21 17:29:44,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 79 remaining) [2022-07-21 17:29:44,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 79 remaining) [2022-07-21 17:29:44,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 79 remaining) [2022-07-21 17:29:44,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 79 remaining) [2022-07-21 17:29:44,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (3 of 79 remaining) [2022-07-21 17:29:44,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (2 of 79 remaining) [2022-07-21 17:29:44,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (1 of 79 remaining) [2022-07-21 17:29:44,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (0 of 79 remaining) [2022-07-21 17:29:44,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:45,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:45,126 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:45,130 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:29:45,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,152 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,152 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,153 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,153 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:29:45 BoogieIcfgContainer [2022-07-21 17:29:45,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:29:45,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:29:45,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:29:45,211 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:29:45,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:28:33" (3/4) ... [2022-07-21 17:29:45,213 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 17:29:45,217 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,220 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,220 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,221 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,221 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,221 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:45,271 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 17:29:45,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:29:45,272 INFO L158 Benchmark]: Toolchain (without parser) took 73668.28ms. Allocated memory was 54.5MB in the beginning and 119.5MB in the end (delta: 65.0MB). Free memory was 31.0MB in the beginning and 37.9MB in the end (delta: -6.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2022-07-21 17:29:45,272 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 47.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:29:45,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.66ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.8MB in the beginning and 41.1MB in the end (delta: -10.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-07-21 17:29:45,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.32ms. Allocated memory is still 67.1MB. Free memory was 40.9MB in the beginning and 37.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:29:45,273 INFO L158 Benchmark]: Boogie Preprocessor took 67.12ms. Allocated memory is still 67.1MB. Free memory was 37.8MB in the beginning and 35.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:29:45,273 INFO L158 Benchmark]: RCFGBuilder took 1018.62ms. Allocated memory is still 67.1MB. Free memory was 35.0MB in the beginning and 32.6MB in the end (delta: 2.5MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-07-21 17:29:45,273 INFO L158 Benchmark]: TraceAbstraction took 71688.50ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 32.1MB in the beginning and 43.2MB in the end (delta: -11.1MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2022-07-21 17:29:45,274 INFO L158 Benchmark]: Witness Printer took 61.80ms. Allocated memory is still 119.5MB. Free memory was 43.2MB in the beginning and 37.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:29:45,275 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.24ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 47.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.66ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.8MB in the beginning and 41.1MB in the end (delta: -10.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.32ms. Allocated memory is still 67.1MB. Free memory was 40.9MB in the beginning and 37.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.12ms. Allocated memory is still 67.1MB. Free memory was 37.8MB in the beginning and 35.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.62ms. Allocated memory is still 67.1MB. Free memory was 35.0MB in the beginning and 32.6MB in the end (delta: 2.5MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * TraceAbstraction took 71688.50ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 32.1MB in the beginning and 43.2MB in the end (delta: -11.1MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Witness Printer took 61.80ms. Allocated memory is still 119.5MB. Free memory was 43.2MB in the beginning and 37.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L820-L823] static int (*dispatch_type[])(struct hid_parser *parser, struct hid_item *item) = { hid_parser_main }; [L859] struct hid_device dev; VAL [dev={2:0}, ldv_global_msg_list={1:0}] [L867] CALL entry_point() [L861] CALL probe_23(&dev) [L842] int ret = - -3; VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, ret=3] [L843] CALL, EXPR ldv_malloc(sizeof(struct hid_report_enum)) VAL [\old(size)=1036, dev={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L843] RET, EXPR ldv_malloc(sizeof(struct hid_report_enum)) VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct hid_report_enum))={10:0}, ret=3] [L843] struct hid_report_enum *p = (struct hid_report_enum *)ldv_malloc(sizeof(struct hid_report_enum)); [L844] COND FALSE !(p==0) VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, p={10:0}, ret=3] [L846] CALL LDV_INIT_LIST_HEAD(&p->report_list) VAL [dev={2:0}, ldv_global_msg_list={1:0}, list={10:4}] [L540] list->next = list VAL [dev={2:0}, ldv_global_msg_list={1:0}, list={10:4}, list={10:4}] [L541] list->prev = list VAL [dev={2:0}, ldv_global_msg_list={1:0}, list={10:4}, list={10:4}] [L846] RET LDV_INIT_LIST_HEAD(&p->report_list) VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, p={10:0}, ret=3] [L847] dev->report_enum = p VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, p={10:0}, ret=3] [L848] CALL hid_open_report(dev) [L812] struct hid_parser *parser; [L813] struct hid_item item; VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}] [L814] CALL, EXPR ldv_zalloc(sizeof(struct hid_parser)) VAL [dev={2:0}, ldv_global_msg_list={1:0}] [L533] EXPR, FCALL calloc(size, 1) [L533] return calloc(size, 1); VAL [\old(size)=8, \result={6:0}, calloc(size, 1)={6:0}, dev={2:0}, ldv_global_msg_list={1:0}, size=8] [L814] RET, EXPR ldv_zalloc(sizeof(struct hid_parser)) VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}, ldv_zalloc(sizeof(struct hid_parser))={6:0}] [L814] parser = ldv_zalloc(sizeof(struct hid_parser)) [L815] COND FALSE !(!parser) VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}, parser={6:0}] [L818] parser->device = device VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}, parser={6:0}] [L819] CALL, EXPR ldv_positive() [L519] int r = __VERIFIER_nondet_int(); [L520] COND TRUE r>0 [L520] return r; VAL [\result=1610612738, dev={2:0}, ldv_global_msg_list={1:0}, r=1610612738] [L819] RET, EXPR ldv_positive() [L819] parser->report_id = ldv_positive() VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}, ldv_positive()=1610612738, parser={6:0}] [L824] CALL, EXPR fetch_item(&item) [L778] COND FALSE !(__VERIFIER_nondet_int()) [L781] item->type = 0 VAL [dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L782] item->a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L783] item->b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L784] item->c = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L785] return 0; VAL [\result=0, dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L824] RET, EXPR fetch_item(&item) [L824] COND TRUE fetch_item(&item)!=-1 [L825] EXPR item.type VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, item.type=0, ldv_global_msg_list={1:0}, parser={6:0}] [L825] EXPR dispatch_type[item.type] [L825] CALL dispatch_type[item.type](parser, &item) [L800] EXPR parser->device VAL [dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}, parser={6:0}, parser={6:0}, parser->device={2:0}] [L800] EXPR parser->report_id VAL [dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}, parser={6:0}, parser={6:0}, parser->device={2:0}, parser->report_id=1610612738] [L800] CALL hid_register_report(parser->device, parser->report_id) [L788] EXPR device->report_enum VAL [\old(id)=1610612738, dev={2:0}, device={2:0}, device={2:0}, device->report_enum={10:0}, id=1610612738, ldv_global_msg_list={1:0}] [L788] struct hid_report_enum *report_enum = device->report_enum; [L789] struct hid_report *report; VAL [\old(id)=1610612738, dev={2:0}, device={2:0}, device={2:0}, id=1610612738, ldv_global_msg_list={1:0}, report_enum={10:0}] [L790] report_enum->report_id_hash[id] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 204 locations, 79 error locations. Started 1 CEGAR loops. OverallTime: 71.6s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2759 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2712 mSDsluCounter, 30357 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7799 IncrementalHoareTripleChecker+Unchecked, 24812 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9284 IncrementalHoareTripleChecker+Invalid, 17342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 5545 mSDtfsCounter, 9284 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1105 GetRequests, 708 SyntacticMatches, 25 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 23.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=31, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 739 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 37.8s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1092 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1012 ConstructedInterpolants, 338 QuantifiedInterpolants, 22168 SizeOfPredicates, 335 NumberOfNonLiveVariables, 6101 ConjunctsInSsa, 815 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 17:29:45,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)