./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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_test11.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 d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:04:42,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:04:42,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:04:42,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:04:42,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:04:42,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:04:42,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:04:42,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:04:42,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:04:42,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:04:42,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:04:42,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:04:42,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:04:42,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:04:42,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:04:42,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:04:42,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:04:42,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:04:42,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:04:42,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:04:42,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:04:42,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:04:42,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:04:42,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:04:42,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:04:42,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:04:42,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:04:42,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:04:42,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:04:42,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:04:42,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:04:42,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:04:42,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:04:42,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:04:42,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:04:42,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:04:42,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:04:42,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:04:42,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:04:42,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:04:42,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:04:42,725 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:04:42,751 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:04:42,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:04:42,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:04:42,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:04:42,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:04:42,752 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:04:42,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:04:42,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:04:42,753 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:04:42,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:04:42,753 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:04:42,753 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:04:42,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:04:42,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:04:42,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:04:42,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:04:42,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:04:42,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:04:42,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:04:42,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:04:42,755 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:04:42,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:04:42,755 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:04:42,756 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc [2023-02-15 22:04:42,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:04:43,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:04:43,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:04:43,009 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:04:43,009 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:04:43,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2023-02-15 22:04:43,911 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:04:44,185 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:04:44,185 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2023-02-15 22:04:44,199 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63da31f7/e05bfaaf38f741a1a611849ada94f09c/FLAGd6438d974 [2023-02-15 22:04:44,211 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63da31f7/e05bfaaf38f741a1a611849ada94f09c [2023-02-15 22:04:44,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:04:44,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:04:44,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:04:44,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:04:44,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:04:44,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:04:44" (1/1) ... [2023-02-15 22:04:44,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0367f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:44, skipping insertion in model container [2023-02-15 22:04:44,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:04:44" (1/1) ... [2023-02-15 22:04:44,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:04:44,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:04:44,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:04:44,608 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-15 22:04:44,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@73916ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:44, skipping insertion in model container [2023-02-15 22:04:44,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:04:44,609 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 22:04:44,611 INFO L158 Benchmark]: Toolchain (without parser) took 395.67ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 85.1MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 22:04:44,612 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:04:44,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.08ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 85.1MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 22:04:44,613 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.16ms. Allocated memory is still 113.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.08ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 85.1MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11.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 d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:04:46,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:04:46,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:04:46,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:04:46,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:04:46,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:04:46,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:04:46,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:04:46,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:04:46,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:04:46,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:04:46,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:04:46,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:04:46,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:04:46,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:04:46,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:04:46,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:04:46,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:04:46,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:04:46,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:04:46,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:04:46,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:04:46,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:04:46,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:04:46,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:04:46,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:04:46,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:04:46,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:04:46,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:04:46,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:04:46,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:04:46,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:04:46,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:04:46,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:04:46,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:04:46,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:04:46,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:04:46,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:04:46,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:04:46,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:04:46,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:04:46,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 22:04:46,248 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:04:46,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:04:46,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:04:46,249 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:04:46,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:04:46,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:04:46,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:04:46,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:04:46,254 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:04:46,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:04:46,254 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:04:46,255 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:04:46,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:04:46,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:04:46,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:04:46,255 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:04:46,255 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:04:46,256 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:04:46,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:04:46,256 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:04:46,256 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:04:46,256 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:04:46,256 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:04:46,257 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:04:46,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:04:46,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:04:46,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:04:46,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:04:46,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:04:46,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:04:46,258 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:04:46,258 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:04:46,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:04:46,259 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:04:46,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:04:46,259 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:04:46,259 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:04:46,259 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc [2023-02-15 22:04:46,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:04:46,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:04:46,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:04:46,552 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:04:46,552 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:04:46,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2023-02-15 22:04:47,486 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:04:47,707 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:04:47,707 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2023-02-15 22:04:47,717 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3688f8be/fe3b7140818a4f6c9850d7ae5aef5330/FLAG6a224880c [2023-02-15 22:04:47,729 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3688f8be/fe3b7140818a4f6c9850d7ae5aef5330 [2023-02-15 22:04:47,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:04:47,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:04:47,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:04:47,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:04:47,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:04:47,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:04:47" (1/1) ... [2023-02-15 22:04:47,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d37efa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:47, skipping insertion in model container [2023-02-15 22:04:47,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:04:47" (1/1) ... [2023-02-15 22:04:47,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:04:47,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:04:48,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:04:48,101 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 22:04:48,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:04:48,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:04:48,170 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:04:48,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:04:48,253 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:04:48,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48 WrapperNode [2023-02-15 22:04:48,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:04:48,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:04:48,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:04:48,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:04:48,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,303 INFO L138 Inliner]: procedures = 169, calls = 87, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 92 [2023-02-15 22:04:48,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:04:48,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:04:48,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:04:48,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:04:48,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,346 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:04:48,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:04:48,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:04:48,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:04:48,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (1/1) ... [2023-02-15 22:04:48,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:04:48,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:04:48,390 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) [2023-02-15 22:04:48,397 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 [2023-02-15 22:04:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-15 22:04:48,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-15 22:04:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2023-02-15 22:04:48,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2023-02-15 22:04:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:04:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:04:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:04:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:04:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:04:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:04:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:04:48,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:04:48,526 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:04:48,528 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:04:48,816 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:04:48,825 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:04:48,826 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 22:04:48,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:04:48 BoogieIcfgContainer [2023-02-15 22:04:48,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:04:48,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:04:48,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:04:48,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:04:48,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:04:47" (1/3) ... [2023-02-15 22:04:48,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c495cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:04:48, skipping insertion in model container [2023-02-15 22:04:48,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:04:48" (2/3) ... [2023-02-15 22:04:48,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c495cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:04:48, skipping insertion in model container [2023-02-15 22:04:48,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:04:48" (3/3) ... [2023-02-15 22:04:48,835 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11.i [2023-02-15 22:04:48,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:04:48,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-02-15 22:04:48,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:04:48,897 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36e97cf8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:04:48,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-02-15 22:04:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:04:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:04:48,907 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:48,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:48,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1738627509, now seen corresponding path program 1 times [2023-02-15 22:04:48,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:48,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380576598] [2023-02-15 22:04:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:48,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:48,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:48,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:48,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 22:04:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:49,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:04:49,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:04:49,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:49,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:49,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380576598] [2023-02-15 22:04:49,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380576598] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:49,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:49,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:04:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815690596] [2023-02-15 22:04:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:49,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:04:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:49,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:04:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:04:49,164 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:49,283 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2023-02-15 22:04:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:04:49,286 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-15 22:04:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:49,293 INFO L225 Difference]: With dead ends: 157 [2023-02-15 22:04:49,294 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 22:04:49,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:04:49,297 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:49,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 350 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:04:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 22:04:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 87. [2023-02-15 22:04:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-15 22:04:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-02-15 22:04:49,328 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 11 [2023-02-15 22:04:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:49,329 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-02-15 22:04:49,329 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), 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) [2023-02-15 22:04:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-02-15 22:04:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:04:49,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:49,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:49,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:49,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:49,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:49,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash -851123828, now seen corresponding path program 1 times [2023-02-15 22:04:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:49,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430322503] [2023-02-15 22:04:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:49,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:49,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:49,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:49,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 22:04:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:49,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:04:49,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:04:49,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:49,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:49,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430322503] [2023-02-15 22:04:49,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430322503] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:49,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:49,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:04:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61016998] [2023-02-15 22:04:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:49,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:04:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:04:49,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:04:49,671 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:49,861 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2023-02-15 22:04:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:04:49,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-15 22:04:49,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:49,866 INFO L225 Difference]: With dead ends: 153 [2023-02-15 22:04:49,868 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 22:04:49,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:04:49,871 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 66 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:49,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 300 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:04:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 22:04:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 83. [2023-02-15 22:04:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:04:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-02-15 22:04:49,884 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 11 [2023-02-15 22:04:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:49,884 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-02-15 22:04:49,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-02-15 22:04:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:04:49,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:49,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:49,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:50,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:50,093 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash -470294884, now seen corresponding path program 1 times [2023-02-15 22:04:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:50,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261177342] [2023-02-15 22:04:50,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:50,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:50,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:50,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:50,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:04:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:50,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:04:50,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:04:50,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:50,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:50,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261177342] [2023-02-15 22:04:50,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261177342] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:50,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:50,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:04:50,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88381388] [2023-02-15 22:04:50,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:50,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:04:50,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:04:50,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:04:50,186 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:04:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:50,247 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2023-02-15 22:04:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:04:50,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-15 22:04:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:50,248 INFO L225 Difference]: With dead ends: 150 [2023-02-15 22:04:50,248 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 22:04:50,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:04:50,249 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 63 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:50,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 444 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:04:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 22:04:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 87. [2023-02-15 22:04:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-15 22:04:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2023-02-15 22:04:50,256 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 17 [2023-02-15 22:04:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:50,256 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2023-02-15 22:04:50,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:04:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2023-02-15 22:04:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:04:50,257 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:50,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:50,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:50,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:50,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:50,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -470294895, now seen corresponding path program 1 times [2023-02-15 22:04:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:50,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616708946] [2023-02-15 22:04:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:50,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:50,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:50,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:50,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 22:04:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:50,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:04:50,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:50,565 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:04:50,629 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:04:50,697 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:04:50,698 INFO L350 Elim1Store]: Elim1 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 27 [2023-02-15 22:04:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 22:04:50,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:04:50,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:50,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616708946] [2023-02-15 22:04:50,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616708946] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:04:50,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:04:50,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-15 22:04:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808456772] [2023-02-15 22:04:50,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:04:50,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:04:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:04:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-15 22:04:50,900 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:04:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:51,156 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2023-02-15 22:04:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:04:51,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-15 22:04:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:51,158 INFO L225 Difference]: With dead ends: 114 [2023-02-15 22:04:51,158 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 22:04:51,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-15 22:04:51,159 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 70 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:51,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 222 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2023-02-15 22:04:51,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 22:04:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2023-02-15 22:04:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 85 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 22:04:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-02-15 22:04:51,170 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 17 [2023-02-15 22:04:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:51,171 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-02-15 22:04:51,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:04:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-02-15 22:04:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:04:51,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:51,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:51,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:51,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:51,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -470294894, now seen corresponding path program 1 times [2023-02-15 22:04:51,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:51,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160790158] [2023-02-15 22:04:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:51,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:51,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:51,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 22:04:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:51,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:04:51,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:51,458 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:04:51,462 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:04:51,546 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_23 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))))) is different from true [2023-02-15 22:04:51,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:04:51,565 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:04:51,571 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:04:51,571 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:04:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 22:04:51,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:55,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:55,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160790158] [2023-02-15 22:04:55,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160790158] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:04:55,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [511091572] [2023-02-15 22:04:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:55,777 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:04:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:04:55,778 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:04:55,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-02-15 22:04:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:55,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:04:55,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:55,874 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:04:55,880 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:04:55,931 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_33 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_33))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:04:55,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:04:55,950 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:04:55,957 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:04:55,958 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:04:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 22:04:55,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:56,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [511091572] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:04:56,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:04:56,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-15 22:04:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818016945] [2023-02-15 22:04:56,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:04:56,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:04:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:56,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:04:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=70, Unknown=3, NotChecked=34, Total=132 [2023-02-15 22:04:56,110 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:04:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:56,772 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2023-02-15 22:04:56,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:04:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-15 22:04:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:56,774 INFO L225 Difference]: With dead ends: 211 [2023-02-15 22:04:56,774 INFO L226 Difference]: Without dead ends: 211 [2023-02-15 22:04:56,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=33, Invalid=104, Unknown=3, NotChecked=42, Total=182 [2023-02-15 22:04:56,775 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:56,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 491 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 527 Invalid, 0 Unknown, 428 Unchecked, 0.6s Time] [2023-02-15 22:04:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-15 22:04:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 141. [2023-02-15 22:04:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 123 states have internal predecessors, (161), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 15 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-15 22:04:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 193 transitions. [2023-02-15 22:04:56,788 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 193 transitions. Word has length 17 [2023-02-15 22:04:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:56,789 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 193 transitions. [2023-02-15 22:04:56,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:04:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 193 transitions. [2023-02-15 22:04:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:04:56,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:56,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:56,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-02-15 22:04:57,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:57,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:57,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash -763697902, now seen corresponding path program 1 times [2023-02-15 22:04:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:57,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756108203] [2023-02-15 22:04:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:57,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:57,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 22:04:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:57,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:04:57,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:04:57,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:57,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756108203] [2023-02-15 22:04:57,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756108203] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:57,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:57,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:04:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947813898] [2023-02-15 22:04:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:57,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:04:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:04:57,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:04:57,268 INFO L87 Difference]: Start difference. First operand 141 states and 193 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:04:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:57,300 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2023-02-15 22:04:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:04:57,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-15 22:04:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:57,301 INFO L225 Difference]: With dead ends: 123 [2023-02-15 22:04:57,302 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 22:04:57,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:04:57,302 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:57,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:04:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 22:04:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-15 22:04:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 84 states have (on average 1.619047619047619) internal successors, (136), 107 states have internal predecessors, (136), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-15 22:04:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 158 transitions. [2023-02-15 22:04:57,308 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 158 transitions. Word has length 17 [2023-02-15 22:04:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:57,308 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 158 transitions. [2023-02-15 22:04:57,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:04:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2023-02-15 22:04:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:04:57,309 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:57,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:57,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:57,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:57,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash -806735705, now seen corresponding path program 1 times [2023-02-15 22:04:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:57,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170286731] [2023-02-15 22:04:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:57,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:57,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:57,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:04:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:57,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:04:57,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:04:57,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:04:57,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:57,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170286731] [2023-02-15 22:04:57,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170286731] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:04:57,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:04:57,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:04:57,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814494562] [2023-02-15 22:04:57,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:04:57,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:04:57,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:04:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:04:57,762 INFO L87 Difference]: Start difference. First operand 121 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:04:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:57,941 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2023-02-15 22:04:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:04:57,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-02-15 22:04:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:57,943 INFO L225 Difference]: With dead ends: 124 [2023-02-15 22:04:57,943 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 22:04:57,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:04:57,943 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 71 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:57,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 279 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:04:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 22:04:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-15 22:04:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 107 states have internal predecessors, (136), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-15 22:04:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2023-02-15 22:04:57,948 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 18 [2023-02-15 22:04:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:57,948 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2023-02-15 22:04:57,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:04:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2023-02-15 22:04:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:04:57,949 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:57,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:57,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:58,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:58,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1173731936, now seen corresponding path program 1 times [2023-02-15 22:04:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:58,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220787632] [2023-02-15 22:04:58,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:58,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:58,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:58,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 22:04:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:58,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:04:58,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:58,303 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)))) is different from true [2023-02-15 22:04:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:04:58,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:58,385 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ bv0 1))))) is different from false [2023-02-15 22:04:58,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:58,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220787632] [2023-02-15 22:04:58,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220787632] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:04:58,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [841524257] [2023-02-15 22:04:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:58,387 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:04:58,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:04:58,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:04:58,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-15 22:04:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:58,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:04:58,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:04:58,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:58,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21|))))) is different from false [2023-02-15 22:04:58,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [841524257] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:04:58,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:04:58,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-15 22:04:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942403961] [2023-02-15 22:04:58,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:04:58,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:04:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:04:58,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2023-02-15 22:04:58,698 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:04:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:59,269 INFO L93 Difference]: Finished difference Result 177 states and 221 transitions. [2023-02-15 22:04:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:04:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-02-15 22:04:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:59,271 INFO L225 Difference]: With dead ends: 177 [2023-02-15 22:04:59,271 INFO L226 Difference]: Without dead ends: 172 [2023-02-15 22:04:59,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2023-02-15 22:04:59,272 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 186 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:59,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 436 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 391 Invalid, 0 Unknown, 103 Unchecked, 0.5s Time] [2023-02-15 22:04:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-15 22:04:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 117. [2023-02-15 22:04:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 103 states have internal predecessors, (130), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-15 22:04:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2023-02-15 22:04:59,276 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 21 [2023-02-15 22:04:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:59,276 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2023-02-15 22:04:59,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:04:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2023-02-15 22:04:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:04:59,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:59,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:59,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:59,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:59,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:59,685 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:04:59,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash -624729604, now seen corresponding path program 1 times [2023-02-15 22:04:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:59,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952427820] [2023-02-15 22:04:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:59,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:04:59,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:59,686 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:04:59,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 22:04:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:59,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:04:59,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:59,751 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:04:59,781 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-15 22:04:59,794 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:04:59,794 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:04:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-15 22:04:59,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:04:59,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:59,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952427820] [2023-02-15 22:04:59,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952427820] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:04:59,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:04:59,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-15 22:04:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823762497] [2023-02-15 22:04:59,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:04:59,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:04:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:04:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-15 22:04:59,929 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:05:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:00,161 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2023-02-15 22:05:00,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:05:00,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-15 22:05:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:00,163 INFO L225 Difference]: With dead ends: 144 [2023-02-15 22:05:00,163 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 22:05:00,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-15 22:05:00,163 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 58 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:00,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 253 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 213 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2023-02-15 22:05:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 22:05:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2023-02-15 22:05:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.5913978494623655) internal successors, (148), 113 states have internal predecessors, (148), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-15 22:05:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2023-02-15 22:05:00,167 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 25 [2023-02-15 22:05:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:00,168 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2023-02-15 22:05:00,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:05:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2023-02-15 22:05:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:05:00,169 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:00,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:00,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:00,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:00,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash -624729603, now seen corresponding path program 1 times [2023-02-15 22:05:00,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:00,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963166325] [2023-02-15 22:05:00,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:00,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:00,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:00,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:00,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 22:05:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:00,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:05:00,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:00,453 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:00,527 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|))) is different from true [2023-02-15 22:05:00,540 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:05:00,541 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-15 22:05:00,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:00,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:00,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963166325] [2023-02-15 22:05:00,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963166325] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:00,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [726892745] [2023-02-15 22:05:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:00,724 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:05:00,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:05:00,725 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:05:00,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-02-15 22:05:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:00,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:05:00,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:00,844 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:00,848 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:00,959 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:05:00,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:00,972 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:00,985 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:00,986 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:05:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-15 22:05:00,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:03,064 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv4 32)))) (and (forall ((|v_ldv_malloc_#res.base_59| (_ BitVec 32))) (or (forall ((v_ArrVal_105 (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#res.base_59| v_ArrVal_105) |c_ULTIMATE.start_entry_point_~cfg~1#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_59|))))) (or (bvule |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| .cse0) (forall ((|v_ldv_malloc_#res.base_59| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_59|))))))) is different from false [2023-02-15 22:05:03,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [726892745] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:03,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:03,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-15 22:05:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432860100] [2023-02-15 22:05:03,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:03,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:05:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:03,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:05:03,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=149, Unknown=3, NotChecked=78, Total=272 [2023-02-15 22:05:03,069 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:05:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:03,737 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2023-02-15 22:05:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:05:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-02-15 22:05:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:03,738 INFO L225 Difference]: With dead ends: 247 [2023-02-15 22:05:03,738 INFO L226 Difference]: Without dead ends: 247 [2023-02-15 22:05:03,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=53, Invalid=196, Unknown=3, NotChecked=90, Total=342 [2023-02-15 22:05:03,739 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 137 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:03,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 789 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 571 Invalid, 0 Unknown, 352 Unchecked, 0.6s Time] [2023-02-15 22:05:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-15 22:05:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 184. [2023-02-15 22:05:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 161 states have internal predecessors, (225), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-15 22:05:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2023-02-15 22:05:03,748 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 25 [2023-02-15 22:05:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:03,748 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2023-02-15 22:05:03,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:05:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2023-02-15 22:05:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:05:03,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:03,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:03,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:03,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:04,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:04,152 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1130288229, now seen corresponding path program 1 times [2023-02-15 22:05:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:04,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003500053] [2023-02-15 22:05:04,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:04,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:04,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:04,154 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:04,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 22:05:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:04,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:05:04,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:05:04,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:04,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003500053] [2023-02-15 22:05:04,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003500053] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:04,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:04,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:05:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174770493] [2023-02-15 22:05:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:04,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:05:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:05:04,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:04,250 INFO L87 Difference]: Start difference. First operand 184 states and 264 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:05:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:04,274 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2023-02-15 22:05:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:05:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-15 22:05:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:04,276 INFO L225 Difference]: With dead ends: 119 [2023-02-15 22:05:04,276 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 22:05:04,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:04,277 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:04,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:05:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 22:05:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-02-15 22:05:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 103 states have internal predecessors, (128), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 22:05:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2023-02-15 22:05:04,280 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 25 [2023-02-15 22:05:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:04,280 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2023-02-15 22:05:04,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:05:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2023-02-15 22:05:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:05:04,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:04,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:04,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-02-15 22:05:04,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:04,492 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2108218693, now seen corresponding path program 1 times [2023-02-15 22:05:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:04,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333243497] [2023-02-15 22:05:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:04,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:04,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:04,493 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:04,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 22:05:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:04,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:05:04,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:05:04,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:04,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:04,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333243497] [2023-02-15 22:05:04,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333243497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:04,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:04,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:05:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911765219] [2023-02-15 22:05:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:04,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:05:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:04,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:05:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:04,576 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-02-15 22:05:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:04,608 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2023-02-15 22:05:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:05:04,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 26 [2023-02-15 22:05:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:04,609 INFO L225 Difference]: With dead ends: 162 [2023-02-15 22:05:04,609 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 22:05:04,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:04,609 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 52 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:04,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 408 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:05:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 22:05:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 117. [2023-02-15 22:05:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 103 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 22:05:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2023-02-15 22:05:04,618 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 26 [2023-02-15 22:05:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:04,619 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2023-02-15 22:05:04,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-02-15 22:05:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2023-02-15 22:05:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:05:04,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:04,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:04,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:04,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:04,826 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:04,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1299244922, now seen corresponding path program 1 times [2023-02-15 22:05:04,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:04,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246290706] [2023-02-15 22:05:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:04,828 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:04,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 22:05:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:04,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:05:04,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:05:05,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:05:05,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:05,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246290706] [2023-02-15 22:05:05,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246290706] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:05:05,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:05,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:05:05,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155326000] [2023-02-15 22:05:05,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:05,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:05:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:05,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:05:05,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:05:05,153 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:05,376 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2023-02-15 22:05:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:05:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2023-02-15 22:05:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:05,377 INFO L225 Difference]: With dead ends: 116 [2023-02-15 22:05:05,377 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 22:05:05,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:05:05,378 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 110 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:05,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 315 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:05:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 22:05:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-15 22:05:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 102 states have internal predecessors, (124), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 22:05:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2023-02-15 22:05:05,381 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 26 [2023-02-15 22:05:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:05,381 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2023-02-15 22:05:05,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2023-02-15 22:05:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:05:05,382 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:05,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:05,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:05,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:05,589 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:05,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash 930272189, now seen corresponding path program 1 times [2023-02-15 22:05:05,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:05,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748270500] [2023-02-15 22:05:05,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:05,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:05,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:05,590 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:05,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 22:05:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:05,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:05:05,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:05,655 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:05,673 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-15 22:05:05,685 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:05:05,686 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:05:05,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:05,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:05,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748270500] [2023-02-15 22:05:05,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748270500] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:05,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:05,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:05:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084600592] [2023-02-15 22:05:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:05,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:05:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:05:05,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-15 22:05:05,703 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2023-02-15 22:05:05,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:05,845 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2023-02-15 22:05:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:05:05,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 27 [2023-02-15 22:05:05,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:05,846 INFO L225 Difference]: With dead ends: 145 [2023-02-15 22:05:05,846 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 22:05:05,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-15 22:05:05,847 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:05,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2023-02-15 22:05:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 22:05:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2023-02-15 22:05:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 101 states have internal predecessors, (122), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 22:05:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2023-02-15 22:05:05,850 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 27 [2023-02-15 22:05:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:05,850 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2023-02-15 22:05:05,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2023-02-15 22:05:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2023-02-15 22:05:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:05:05,850 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:05,850 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:05,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:06,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:06,057 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash 930272190, now seen corresponding path program 1 times [2023-02-15 22:05:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:06,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152165766] [2023-02-15 22:05:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:06,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:06,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:06,059 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:06,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 22:05:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:06,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:05:06,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:06,136 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:06,139 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:06,219 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_178 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_178))))) is different from true [2023-02-15 22:05:06,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:06,231 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:06,237 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:06,238 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:05:06,277 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_179 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_179))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:05:06,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:06,289 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:06,302 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:06,303 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:05:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-15 22:05:06,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:08,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152165766] [2023-02-15 22:05:08,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152165766] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [612823010] [2023-02-15 22:05:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:08,627 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:05:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:05:08,628 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:05:08,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-15 22:05:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:08,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 22:05:08,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:08,738 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:08,742 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:08,816 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:05:08,817 INFO L350 Elim1Store]: Elim1 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 18 [2023-02-15 22:05:08,827 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:08,828 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:05:08,887 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_204 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_204))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:05:08,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:08,900 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:08,909 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:08,909 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:05:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-02-15 22:05:08,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:11,043 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv4 32)))) (and (forall ((|v_ldv_malloc_#res.base_76| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_76|))) (forall ((v_ArrVal_207 (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#res.base_76| v_ArrVal_207) |c_ULTIMATE.start_entry_point_~c11~0#1.base|))))) (or (bvule |c_ULTIMATE.start_entry_point_~c11~0#1.offset| .cse0) (forall ((|v_ldv_malloc_#res.base_76| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_76|))))))) is different from false [2023-02-15 22:05:11,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [612823010] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:11,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:11,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 13 [2023-02-15 22:05:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210480442] [2023-02-15 22:05:11,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:11,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:05:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:11,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:05:11,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=153, Unknown=5, NotChecked=108, Total=306 [2023-02-15 22:05:11,047 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:05:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:11,905 INFO L93 Difference]: Finished difference Result 204 states and 224 transitions. [2023-02-15 22:05:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:05:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2023-02-15 22:05:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:11,906 INFO L225 Difference]: With dead ends: 204 [2023-02-15 22:05:11,906 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 22:05:11,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=253, Unknown=5, NotChecked=140, Total=462 [2023-02-15 22:05:11,907 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 151 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 22 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:11,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 962 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 750 Invalid, 8 Unknown, 393 Unchecked, 0.7s Time] [2023-02-15 22:05:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 22:05:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2023-02-15 22:05:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 100 states have internal predecessors, (120), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 22:05:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2023-02-15 22:05:11,910 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 27 [2023-02-15 22:05:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:11,910 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2023-02-15 22:05:11,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:05:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2023-02-15 22:05:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:05:11,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:11,910 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:11,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:12,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:12,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:12,311 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:12,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 638376382, now seen corresponding path program 1 times [2023-02-15 22:05:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:12,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292134959] [2023-02-15 22:05:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:12,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:12,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:12,313 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:12,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 22:05:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:12,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:05:12,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:12,436 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:12,456 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:12,540 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:05:12,541 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 22:05:12,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:05:12,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-02-15 22:05:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:05:12,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:12,789 INFO L321 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2023-02-15 22:05:12,790 INFO L350 Elim1Store]: Elim1 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 69 treesize of output 68 [2023-02-15 22:05:12,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:12,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292134959] [2023-02-15 22:05:12,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292134959] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:12,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1093024462] [2023-02-15 22:05:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:05:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:05:12,842 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:05:12,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-15 22:05:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:12,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 22:05:12,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:12,973 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:13,090 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:13,090 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:05:13,150 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:15,186 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|))) is different from true [2023-02-15 22:05:15,255 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:05:15,255 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 22:05:15,330 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 15 [2023-02-15 22:05:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 22:05:15,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:15,349 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2023-02-15 22:05:15,350 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2023-02-15 22:05:15,354 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_253) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) is different from false [2023-02-15 22:05:15,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1093024462] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:15,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:15,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-15 22:05:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388293850] [2023-02-15 22:05:15,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:15,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:05:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:05:15,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=783, Unknown=2, NotChecked=114, Total=992 [2023-02-15 22:05:15,365 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:27,548 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2023-02-15 22:05:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:05:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-02-15 22:05:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:27,550 INFO L225 Difference]: With dead ends: 183 [2023-02-15 22:05:27,550 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 22:05:27,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=360, Invalid=2093, Unknown=5, NotChecked=194, Total=2652 [2023-02-15 22:05:27,551 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 339 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:27,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1402 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1331 Invalid, 0 Unknown, 168 Unchecked, 1.2s Time] [2023-02-15 22:05:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 22:05:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 88. [2023-02-15 22:05:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:05:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-15 22:05:27,554 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 29 [2023-02-15 22:05:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:27,554 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-15 22:05:27,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-15 22:05:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:05:27,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:27,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:27,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:27,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:27,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:27,958 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash 638376383, now seen corresponding path program 1 times [2023-02-15 22:05:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:27,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198704484] [2023-02-15 22:05:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:27,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:27,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:27,960 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:27,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-15 22:05:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:28,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 22:05:28,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:28,046 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:28,099 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:05:28,099 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:05:28,135 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:28,142 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:28,262 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:05:28,263 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-02-15 22:05:28,267 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 33 [2023-02-15 22:05:28,334 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 19 [2023-02-15 22:05:28,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 14 [2023-02-15 22:05:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:28,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:28,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:05:28,647 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 54 [2023-02-15 22:05:28,708 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_6) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) (and .cse0 (or (and .cse0 (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_278) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32))))) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_277) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) |c_ULTIMATE.start_entry_point_~cfg~1#1.base|))) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_278) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv4 32)))))) is different from false [2023-02-15 22:05:28,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198704484] [2023-02-15 22:05:28,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198704484] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [139931963] [2023-02-15 22:05:28,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:28,765 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:05:28,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:05:28,766 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:05:28,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-15 22:05:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:28,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 22:05:28,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:28,902 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:29,036 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:31,118 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:05:31,119 INFO L350 Elim1Store]: Elim1 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 27 [2023-02-15 22:05:31,248 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:31,254 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:31,341 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-15 22:05:31,345 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:31,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_304 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_304)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|))))) is different from true [2023-02-15 22:05:31,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:31,461 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:31,477 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-02-15 22:05:31,477 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-15 22:05:31,615 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:05:31,615 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 22:05:31,622 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-15 22:05:31,720 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 13 [2023-02-15 22:05:31,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-02-15 22:05:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 22:05:31,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:05:31,855 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_306) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2023-02-15 22:05:31,942 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_89| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_89|))) (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_89| v_ArrVal_309) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_306) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))))) (or (forall ((|v_ldv_malloc_#res.base_89| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_89|)))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))))) is different from false [2023-02-15 22:05:31,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [139931963] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:05:31,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:05:31,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2023-02-15 22:05:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358818496] [2023-02-15 22:05:31,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:05:31,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 22:05:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 22:05:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=952, Unknown=5, NotChecked=260, Total=1332 [2023-02-15 22:05:31,949 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:33,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:35,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:38,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:43,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:45,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:47,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:49,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:51,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:53,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:05:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:53,934 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2023-02-15 22:05:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:05:53,935 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-02-15 22:05:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:53,936 INFO L225 Difference]: With dead ends: 155 [2023-02-15 22:05:53,936 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 22:05:53,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=247, Invalid=1569, Unknown=6, NotChecked=340, Total=2162 [2023-02-15 22:05:53,937 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 292 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 43 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:53,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 726 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 987 Invalid, 10 Unknown, 128 Unchecked, 19.0s Time] [2023-02-15 22:05:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 22:05:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2023-02-15 22:05:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:05:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-02-15 22:05:53,940 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 29 [2023-02-15 22:05:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:53,940 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-02-15 22:05:53,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-02-15 22:05:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:05:53,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:53,941 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:53,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:54,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:54,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:54,344 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:05:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1844886222, now seen corresponding path program 1 times [2023-02-15 22:05:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:54,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733871657] [2023-02-15 22:05:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:54,345 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:54,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-15 22:05:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:54,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 22:05:54,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:58,719 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_322 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_322))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |c_#valid| (store (store .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)) |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)))) is different from true [2023-02-15 22:05:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:05:58,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:00,877 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret44#1.base_35| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_35|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_35| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))))) is different from false [2023-02-15 22:06:00,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:00,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733871657] [2023-02-15 22:06:00,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733871657] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:00,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1416007778] [2023-02-15 22:06:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:00,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:06:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:06:00,879 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:06:00,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-15 22:06:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:00,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 22:06:00,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:07,475 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((v_ArrVal_322 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_322))) (let ((.cse1 (store .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= (_ bv0 1) (bvadd (select .cse1 |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (= |c_#valid| (store .cse1 |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))))))) is different from true [2023-02-15 22:06:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:06:07,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:07,660 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 13 [2023-02-15 22:06:13,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1416007778] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:13,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:13,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2023-02-15 22:06:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225354555] [2023-02-15 22:06:13,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:13,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 22:06:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 22:06:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=12, NotChecked=162, Total=930 [2023-02-15 22:06:13,970 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:18,358 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2023-02-15 22:06:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:06:18,358 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-02-15 22:06:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:18,359 INFO L225 Difference]: With dead ends: 128 [2023-02-15 22:06:18,359 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 22:06:18,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=12, NotChecked=228, Total=1722 [2023-02-15 22:06:18,360 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 152 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:18,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 505 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 560 Invalid, 0 Unknown, 262 Unchecked, 0.7s Time] [2023-02-15 22:06:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 22:06:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 81. [2023-02-15 22:06:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:06:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-02-15 22:06:18,363 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 32 [2023-02-15 22:06:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:18,363 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-02-15 22:06:18,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-02-15 22:06:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:06:18,364 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:18,364 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:18,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:18,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:18,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:18,767 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:06:18,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash -316571990, now seen corresponding path program 1 times [2023-02-15 22:06:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:18,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850555867] [2023-02-15 22:06:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:18,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:18,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:18,769 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:18,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-15 22:06:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:18,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 22:06:18,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:18,871 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:06:18,909 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:06:18,909 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:06:18,932 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:18,940 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:20,966 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_17|) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30|))) is different from true [2023-02-15 22:06:20,971 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:06:25,133 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 22:06:25,133 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-02-15 22:06:25,140 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 32 [2023-02-15 22:06:25,210 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 19 [2023-02-15 22:06:25,345 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:06:25,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-15 22:06:25,433 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_379 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_379))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:06:25,456 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:06:25,457 INFO L350 Elim1Store]: Elim1 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 27 [2023-02-15 22:06:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-15 22:06:25,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:25,955 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |c_ULTIMATE.start_entry_point_#t~ret45#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_376) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (_ bv1 1)))) is different from false [2023-02-15 22:06:25,973 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 76 [2023-02-15 22:06:25,981 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_entry_point_#t~ret45#1.base_34| (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_34|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_376) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) |v_ULTIMATE.start_entry_point_#t~ret45#1.base_34|)) is different from false [2023-02-15 22:06:25,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:25,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850555867] [2023-02-15 22:06:25,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850555867] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:25,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2094102873] [2023-02-15 22:06:25,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:25,983 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:06:25,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:06:25,984 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:06:25,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-15 22:06:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:26,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 22:06:26,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:26,129 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:06:28,317 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:06:28,317 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:06:28,424 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:28,431 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:28,596 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:06:28,907 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:06:28,907 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2023-02-15 22:06:28,915 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-15 22:06:29,052 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:29,232 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:06:29,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-15 22:06:29,246 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_413 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_413))))) is different from true [2023-02-15 22:06:29,266 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:06:29,266 INFO L350 Elim1Store]: Elim1 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 27 [2023-02-15 22:06:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-15 22:06:29,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:29,676 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 76 [2023-02-15 22:06:29,685 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_entry_point_#t~ret45#1.base_37| (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_37|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_376) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) |v_ULTIMATE.start_entry_point_#t~ret45#1.base_37|)) is different from false [2023-02-15 22:06:29,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2094102873] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:06:29,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:29,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2023-02-15 22:06:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978860658] [2023-02-15 22:06:29,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:29,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 22:06:29,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 22:06:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1433, Unknown=14, NotChecked=486, Total=2070 [2023-02-15 22:06:29,688 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:06:31,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:39,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:41,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:43,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:54,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:56,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:58,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:00,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:00,719 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2023-02-15 22:07:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:07:00,719 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2023-02-15 22:07:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:00,720 INFO L225 Difference]: With dead ends: 128 [2023-02-15 22:07:00,720 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 22:07:00,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=366, Invalid=2610, Unknown=18, NotChecked=666, Total=3660 [2023-02-15 22:07:00,721 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 242 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 54 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:00,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1000 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1347 Invalid, 8 Unknown, 344 Unchecked, 17.9s Time] [2023-02-15 22:07:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 22:07:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2023-02-15 22:07:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.303030303030303) internal successors, (86), 80 states have internal predecessors, (86), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 22:07:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-02-15 22:07:00,724 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 38 [2023-02-15 22:07:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:00,724 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-02-15 22:07:00,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:07:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-02-15 22:07:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:07:00,725 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:00,725 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:00,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:00,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:01,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:01,134 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:01,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash -316571989, now seen corresponding path program 1 times [2023-02-15 22:07:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:01,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939625477] [2023-02-15 22:07:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:01,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:01,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:01,135 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:01,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-15 22:07:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:01,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 22:07:01,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:01,237 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:01,283 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:01,284 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:01,308 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:01,313 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:03,339 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_20|) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34|))) is different from true [2023-02-15 22:07:05,378 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:05,396 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:07,606 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 22:07:07,608 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-15 22:07:07,612 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2023-02-15 22:07:07,825 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 22:07:07,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 45 [2023-02-15 22:07:07,829 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-15 22:07:07,947 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_449 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_449))))) is different from true [2023-02-15 22:07:07,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:07,962 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:07,970 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:07,970 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-02-15 22:07:08,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:10,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939625477] [2023-02-15 22:07:10,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939625477] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1520857986] [2023-02-15 22:07:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:10,399 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:10,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:07:10,400 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:07:10,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-15 22:07:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:10,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-15 22:07:10,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:10,579 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:10,746 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:10,747 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:10,838 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:10,847 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:11,074 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:11,079 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:11,411 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:07:11,411 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2023-02-15 22:07:11,417 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 22 [2023-02-15 22:07:11,786 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-15 22:07:11,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 44 [2023-02-15 22:07:11,797 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:07:11,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 22:07:11,848 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_484 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_484))))) is different from true [2023-02-15 22:07:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:11,861 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:11,867 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:11,867 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 22:07:11,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:12,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1520857986] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:12,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:12,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2023-02-15 22:07:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534305148] [2023-02-15 22:07:12,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:12,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 22:07:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:12,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 22:07:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1438, Unknown=3, NotChecked=234, Total=1806 [2023-02-15 22:07:12,822 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:07:14,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:17,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:26,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:28,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:30,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:33,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:07:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:33,411 INFO L93 Difference]: Finished difference Result 189 states and 207 transitions. [2023-02-15 22:07:33,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:07:33,412 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2023-02-15 22:07:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:33,412 INFO L225 Difference]: With dead ends: 189 [2023-02-15 22:07:33,413 INFO L226 Difference]: Without dead ends: 189 [2023-02-15 22:07:33,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=306, Invalid=2673, Unknown=3, NotChecked=324, Total=3306 [2023-02-15 22:07:33,418 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 284 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 53 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:33,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2363 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2408 Invalid, 6 Unknown, 600 Unchecked, 14.9s Time] [2023-02-15 22:07:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-02-15 22:07:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 93. [2023-02-15 22:07:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 80 states have internal predecessors, (85), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 22:07:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2023-02-15 22:07:33,421 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 38 [2023-02-15 22:07:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:33,422 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2023-02-15 22:07:33,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:07:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2023-02-15 22:07:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:07:33,423 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:33,424 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:33,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:33,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:33,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:33,836 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1161043861, now seen corresponding path program 1 times [2023-02-15 22:07:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:33,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507115718] [2023-02-15 22:07:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:33,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:33,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:33,837 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:33,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-15 22:07:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:33,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:07:33,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:07:33,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:33,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:33,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507115718] [2023-02-15 22:07:33,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507115718] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:33,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:33,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:07:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197672924] [2023-02-15 22:07:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:33,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:07:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:33,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:07:33,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:33,942 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:07:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:33,963 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-15 22:07:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:07:33,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-02-15 22:07:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:33,964 INFO L225 Difference]: With dead ends: 81 [2023-02-15 22:07:33,964 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 22:07:33,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:33,965 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:33,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:07:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 22:07:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-02-15 22:07:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 66 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:07:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-02-15 22:07:33,967 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 38 [2023-02-15 22:07:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:33,967 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-02-15 22:07:33,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:07:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-02-15 22:07:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:07:33,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:33,968 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:33,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:34,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:34,175 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash 717010680, now seen corresponding path program 1 times [2023-02-15 22:07:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:34,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212722224] [2023-02-15 22:07:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:34,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:34,176 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:34,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-15 22:07:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:34,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:07:34,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:34,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:34,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:34,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212722224] [2023-02-15 22:07:34,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212722224] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:34,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:34,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:07:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346920533] [2023-02-15 22:07:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:34,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:07:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:34,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:07:34,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:34,285 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:07:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:34,319 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2023-02-15 22:07:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:07:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-02-15 22:07:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:34,322 INFO L225 Difference]: With dead ends: 116 [2023-02-15 22:07:34,322 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 22:07:34,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:34,323 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:34,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 279 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:07:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 22:07:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2023-02-15 22:07:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.280701754385965) internal successors, (73), 69 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:07:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-15 22:07:34,325 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 40 [2023-02-15 22:07:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:34,325 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-15 22:07:34,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:07:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-15 22:07:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:07:34,325 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:34,326 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:34,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:34,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:34,533 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1835146281, now seen corresponding path program 1 times [2023-02-15 22:07:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:34,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649586006] [2023-02-15 22:07:34,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:34,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:34,535 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:34,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-15 22:07:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:34,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:07:34,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:07:34,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:34,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:34,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649586006] [2023-02-15 22:07:34,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649586006] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:34,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:34,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:07:34,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604931557] [2023-02-15 22:07:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:34,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:07:34,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:07:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:07:34,667 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:07:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:34,910 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2023-02-15 22:07:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:07:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-02-15 22:07:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:34,911 INFO L225 Difference]: With dead ends: 111 [2023-02-15 22:07:34,911 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 22:07:34,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:07:34,912 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:34,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 317 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:07:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 22:07:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2023-02-15 22:07:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-15 22:07:34,914 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 40 [2023-02-15 22:07:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:34,914 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-15 22:07:34,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:07:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-15 22:07:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:07:34,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:34,915 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:34,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:35,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:35,121 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1835146280, now seen corresponding path program 1 times [2023-02-15 22:07:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:35,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639905782] [2023-02-15 22:07:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:35,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:35,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:35,123 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:35,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-15 22:07:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:35,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 22:07:35,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:35,225 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:35,229 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:35,295 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_564 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_564))))) is different from true [2023-02-15 22:07:35,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:35,305 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:35,324 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:35,324 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:35,370 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_565 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_565))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:07:35,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:35,382 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:35,389 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:35,389 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-15 22:07:35,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:36,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:36,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639905782] [2023-02-15 22:07:36,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639905782] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:36,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1338506671] [2023-02-15 22:07:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:36,116 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:36,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:07:36,116 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:07:36,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-02-15 22:07:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:36,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 22:07:36,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:36,282 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:36,285 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:36,382 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:07:36,383 INFO L350 Elim1Store]: Elim1 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 18 [2023-02-15 22:07:36,394 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:36,395 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:36,465 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_590 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_590))))) is different from true [2023-02-15 22:07:36,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:36,483 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:36,491 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:36,492 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-15 22:07:36,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:37,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1338506671] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:37,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:37,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 16 [2023-02-15 22:07:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373952347] [2023-02-15 22:07:37,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:37,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 22:07:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 22:07:37,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=334, Unknown=3, NotChecked=114, Total=506 [2023-02-15 22:07:37,512 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:07:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:38,414 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2023-02-15 22:07:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:07:38,415 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2023-02-15 22:07:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:38,416 INFO L225 Difference]: With dead ends: 121 [2023-02-15 22:07:38,416 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 22:07:38,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=89, Invalid=520, Unknown=3, NotChecked=144, Total=756 [2023-02-15 22:07:38,416 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 98 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 10 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:38,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 746 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 502 Invalid, 7 Unknown, 351 Unchecked, 0.6s Time] [2023-02-15 22:07:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 22:07:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2023-02-15 22:07:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-15 22:07:38,419 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 40 [2023-02-15 22:07:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:38,419 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-15 22:07:38,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:07:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-15 22:07:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:07:38,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:38,420 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:38,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:38,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:38,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:38,827 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 752121782, now seen corresponding path program 1 times [2023-02-15 22:07:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:38,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634214447] [2023-02-15 22:07:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:38,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:38,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:38,857 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:38,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-02-15 22:07:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:38,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:07:38,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:38,979 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:38,997 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-15 22:07:39,007 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:07:39,007 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:07:39,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:39,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:39,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634214447] [2023-02-15 22:07:39,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634214447] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:39,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:39,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:07:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631002713] [2023-02-15 22:07:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:39,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:07:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:07:39,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-02-15 22:07:39,031 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:07:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:39,143 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-02-15 22:07:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:07:39,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-02-15 22:07:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:39,145 INFO L225 Difference]: With dead ends: 94 [2023-02-15 22:07:39,145 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 22:07:39,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2023-02-15 22:07:39,145 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:39,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 197 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2023-02-15 22:07:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 22:07:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2023-02-15 22:07:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 74 states have internal predecessors, (77), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2023-02-15 22:07:39,147 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 41 [2023-02-15 22:07:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:39,148 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2023-02-15 22:07:39,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:07:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2023-02-15 22:07:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:07:39,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:39,148 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:39,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:39,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:39,356 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash 752121783, now seen corresponding path program 1 times [2023-02-15 22:07:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:39,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199703009] [2023-02-15 22:07:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:39,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:39,358 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:39,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-15 22:07:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:39,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 22:07:39,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:39,479 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:39,484 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:39,558 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_650 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_650))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:07:39,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:39,571 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:39,581 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:39,581 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:39,624 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_651 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_651))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:07:39,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:39,643 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:39,651 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:39,651 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:39,721 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_652 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_652))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:07:39,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:39,743 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:39,753 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:39,753 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2023-02-15 22:07:39,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:42,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:42,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199703009] [2023-02-15 22:07:42,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199703009] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1660382125] [2023-02-15 22:07:42,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:42,154 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:42,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:07:42,155 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:07:42,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-02-15 22:07:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:42,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 22:07:42,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:42,352 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:42,355 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:42,443 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:07:42,444 INFO L350 Elim1Store]: Elim1 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 18 [2023-02-15 22:07:42,460 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:42,461 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:42,535 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_685 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_685))))) is different from true [2023-02-15 22:07:42,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:42,545 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:42,553 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:42,553 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:42,598 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_686 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_686))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:07:42,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:42,608 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:42,614 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:42,614 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:07:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 10 not checked. [2023-02-15 22:07:42,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:44,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1660382125] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:44,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:44,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2023-02-15 22:07:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197270211] [2023-02-15 22:07:44,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:44,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:07:44,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:07:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=270, Unknown=5, NotChecked=180, Total=506 [2023-02-15 22:07:44,831 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 22:07:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:45,558 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2023-02-15 22:07:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:07:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2023-02-15 22:07:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:45,559 INFO L225 Difference]: With dead ends: 126 [2023-02-15 22:07:45,559 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 22:07:45,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=86, Invalid=481, Unknown=5, NotChecked=240, Total=812 [2023-02-15 22:07:45,559 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 128 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 13 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:45,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 690 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 538 Invalid, 6 Unknown, 455 Unchecked, 0.5s Time] [2023-02-15 22:07:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 22:07:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2023-02-15 22:07:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 73 states have internal predecessors, (76), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2023-02-15 22:07:45,562 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 41 [2023-02-15 22:07:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:45,562 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2023-02-15 22:07:45,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 22:07:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2023-02-15 22:07:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:07:45,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:45,562 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:45,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:45,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:45,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:45,970 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1833421355, now seen corresponding path program 1 times [2023-02-15 22:07:45,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:45,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225241483] [2023-02-15 22:07:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:45,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:45,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:45,971 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:45,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-02-15 22:07:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:46,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 22:07:46,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:07:46,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:46,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:07:46,580 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 28 [2023-02-15 22:07:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:46,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:46,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225241483] [2023-02-15 22:07:46,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225241483] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:07:46,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:46,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-15 22:07:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681127618] [2023-02-15 22:07:46,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:46,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:07:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:46,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:07:46,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:07:46,914 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-15 22:07:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:47,469 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-02-15 22:07:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:07:47,470 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 46 [2023-02-15 22:07:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:47,470 INFO L225 Difference]: With dead ends: 85 [2023-02-15 22:07:47,470 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 22:07:47,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:07:47,471 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 136 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:47,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 412 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:07:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 22:07:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-15 22:07:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 72 states have internal predecessors, (75), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-02-15 22:07:47,473 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 46 [2023-02-15 22:07:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:47,473 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-02-15 22:07:47,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-15 22:07:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-02-15 22:07:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:07:47,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:47,474 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:47,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:47,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:47,677 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:47,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1833421356, now seen corresponding path program 1 times [2023-02-15 22:07:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:47,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583022164] [2023-02-15 22:07:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:47,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:47,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:47,680 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:47,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-02-15 22:07:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:47,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:07:47,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:07:47,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:47,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:47,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583022164] [2023-02-15 22:07:47,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583022164] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:47,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:47,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:07:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049485078] [2023-02-15 22:07:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:47,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:07:47,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:07:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:07:47,839 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:48,052 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-15 22:07:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:07:48,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2023-02-15 22:07:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:48,053 INFO L225 Difference]: With dead ends: 112 [2023-02-15 22:07:48,053 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 22:07:48,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:07:48,054 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:48,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 192 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:07:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 22:07:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2023-02-15 22:07:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-15 22:07:48,056 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 46 [2023-02-15 22:07:48,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:48,056 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-15 22:07:48,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-15 22:07:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 22:07:48,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:48,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:48,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:48,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:48,264 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:48,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1963012722, now seen corresponding path program 1 times [2023-02-15 22:07:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:48,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308137560] [2023-02-15 22:07:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:48,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:48,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:48,265 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:48,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-02-15 22:07:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:48,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:07:48,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 22:07:48,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:48,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308137560] [2023-02-15 22:07:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308137560] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:48,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:48,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:07:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415283232] [2023-02-15 22:07:48,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:48,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:07:48,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:48,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:07:48,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:07:48,419 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:48,547 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-02-15 22:07:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:07:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2023-02-15 22:07:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:48,548 INFO L225 Difference]: With dead ends: 94 [2023-02-15 22:07:48,548 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 22:07:48,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:07:48,548 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 82 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:48,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 230 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:07:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 22:07:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2023-02-15 22:07:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 71 states have internal predecessors, (74), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-15 22:07:48,551 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 47 [2023-02-15 22:07:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:48,551 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-15 22:07:48,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-15 22:07:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:07:48,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:48,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:48,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:48,760 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1021505201, now seen corresponding path program 1 times [2023-02-15 22:07:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:48,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146647118] [2023-02-15 22:07:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:48,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:48,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:48,762 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:48,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-02-15 22:07:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:48,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 22:07:48,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:48,992 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:07:48,999 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:07:49,091 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:49,093 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:49,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:49,594 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 21 [2023-02-15 22:07:49,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:49,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:49,710 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 24 [2023-02-15 22:07:49,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:49,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 22:07:49,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:49,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146647118] [2023-02-15 22:07:49,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146647118] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:49,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:07:49,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 19 [2023-02-15 22:07:49,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513884194] [2023-02-15 22:07:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:49,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:07:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:49,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:07:49,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:07:49,811 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:50,441 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2023-02-15 22:07:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:07:50,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-02-15 22:07:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:50,442 INFO L225 Difference]: With dead ends: 126 [2023-02-15 22:07:50,442 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 22:07:50,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-02-15 22:07:50,443 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 155 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:50,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 569 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:07:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 22:07:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2023-02-15 22:07:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 77 states have internal predecessors, (80), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-02-15 22:07:50,445 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 51 [2023-02-15 22:07:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:50,445 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-02-15 22:07:50,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-02-15 22:07:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:07:50,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:50,446 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:50,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:50,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:50,653 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1703598893, now seen corresponding path program 1 times [2023-02-15 22:07:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:50,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333630061] [2023-02-15 22:07:50,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:50,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:50,655 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:50,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-02-15 22:07:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:50,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 22:07:50,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:50,900 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:07:50,978 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 22:07:51,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:51,252 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 24 [2023-02-15 22:07:51,335 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 24 [2023-02-15 22:07:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:51,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:51,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333630061] [2023-02-15 22:07:51,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333630061] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:51,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:07:51,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 22 [2023-02-15 22:07:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717244008] [2023-02-15 22:07:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:51,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:07:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:07:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2023-02-15 22:07:51,484 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:07:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:51,978 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2023-02-15 22:07:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:07:51,979 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2023-02-15 22:07:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:51,979 INFO L225 Difference]: With dead ends: 89 [2023-02-15 22:07:51,979 INFO L226 Difference]: Without dead ends: 89 [2023-02-15 22:07:51,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2023-02-15 22:07:51,980 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 199 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:51,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 430 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:07:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-15 22:07:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-15 22:07:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.161764705882353) internal successors, (79), 76 states have internal predecessors, (79), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2023-02-15 22:07:51,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 52 [2023-02-15 22:07:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:51,982 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2023-02-15 22:07:51,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:07:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2023-02-15 22:07:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:07:51,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:51,983 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:51,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2023-02-15 22:07:52,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:52,190 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1601898209, now seen corresponding path program 1 times [2023-02-15 22:07:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:52,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579883525] [2023-02-15 22:07:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:52,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:52,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:52,192 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:52,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-02-15 22:07:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:52,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:07:52,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:52,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:52,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:52,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579883525] [2023-02-15 22:07:52,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579883525] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:07:52,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:52,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-15 22:07:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554553304] [2023-02-15 22:07:52,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:52,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:07:52,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:52,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:07:52,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:52,416 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:52,441 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2023-02-15 22:07:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:07:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-02-15 22:07:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:52,441 INFO L225 Difference]: With dead ends: 88 [2023-02-15 22:07:52,441 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 22:07:52,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:52,442 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:52,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 209 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:07:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 22:07:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 22:07:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 75 states have internal predecessors, (78), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-15 22:07:52,444 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 52 [2023-02-15 22:07:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:52,444 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-15 22:07:52,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-15 22:07:52,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:07:52,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:52,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:52,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:52,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:52,653 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1271958025, now seen corresponding path program 1 times [2023-02-15 22:07:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:52,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013856578] [2023-02-15 22:07:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:52,655 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:52,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-02-15 22:07:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:52,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 22:07:52,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:53,271 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:07:53,442 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:07:53,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:53,996 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 24 [2023-02-15 22:07:54,098 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 24 [2023-02-15 22:07:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:54,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:54,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013856578] [2023-02-15 22:07:54,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013856578] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:54,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:07:54,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 30 [2023-02-15 22:07:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264716745] [2023-02-15 22:07:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:54,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:07:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:07:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2023-02-15 22:07:54,350 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:07:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:55,453 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2023-02-15 22:07:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:07:55,454 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2023-02-15 22:07:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:55,455 INFO L225 Difference]: With dead ends: 133 [2023-02-15 22:07:55,455 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 22:07:55,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 22:07:55,455 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 203 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:55,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 477 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:07:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 22:07:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2023-02-15 22:07:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 83 states have internal predecessors, (88), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-02-15 22:07:55,457 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 53 [2023-02-15 22:07:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:55,458 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-02-15 22:07:55,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:07:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-02-15 22:07:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:07:55,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:55,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:55,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Ended with exit code 0 [2023-02-15 22:07:55,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:55,666 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1880762957, now seen corresponding path program 1 times [2023-02-15 22:07:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:55,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925850568] [2023-02-15 22:07:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:55,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:55,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:55,668 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:55,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-02-15 22:07:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:55,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:07:55,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:07:56,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:56,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:56,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925850568] [2023-02-15 22:07:56,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925850568] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:07:56,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:56,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:07:56,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281307679] [2023-02-15 22:07:56,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:56,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:07:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:56,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:07:56,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:07:56,284 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-15 22:07:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:56,449 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-02-15 22:07:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:07:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 53 [2023-02-15 22:07:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:56,450 INFO L225 Difference]: With dead ends: 98 [2023-02-15 22:07:56,450 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 22:07:56,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:07:56,450 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 89 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:56,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 200 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:07:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 22:07:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2023-02-15 22:07:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.12987012987013) internal successors, (87), 82 states have internal predecessors, (87), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-02-15 22:07:56,452 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 53 [2023-02-15 22:07:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:56,453 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-02-15 22:07:56,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-15 22:07:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-02-15 22:07:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:07:56,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:56,453 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:56,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Ended with exit code 0 [2023-02-15 22:07:56,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:56,654 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1060607112, now seen corresponding path program 1 times [2023-02-15 22:07:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:56,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589013430] [2023-02-15 22:07:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:56,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:56,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:56,655 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:56,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-02-15 22:07:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:56,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:07:56,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:07:56,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:56,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:56,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589013430] [2023-02-15 22:07:56,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589013430] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:56,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:56,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:07:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908850766] [2023-02-15 22:07:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:56,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:07:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:56,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:07:56,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:56,799 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:56,817 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2023-02-15 22:07:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:07:56,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2023-02-15 22:07:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:56,818 INFO L225 Difference]: With dead ends: 100 [2023-02-15 22:07:56,818 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 22:07:56,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:07:56,819 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 23 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:56,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 321 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:07:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 22:07:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2023-02-15 22:07:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:07:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2023-02-15 22:07:56,821 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 53 [2023-02-15 22:07:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:56,821 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2023-02-15 22:07:56,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:07:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2023-02-15 22:07:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:07:56,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:56,823 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:56,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:57,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:57,030 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash -775993003, now seen corresponding path program 1 times [2023-02-15 22:07:57,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:57,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207424616] [2023-02-15 22:07:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:57,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:57,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:57,032 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:57,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-02-15 22:07:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:57,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 22:07:57,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:57,202 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:57,310 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:07:57,403 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-15 22:07:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 22:07:57,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:57,702 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 32 [2023-02-15 22:07:57,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:57,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207424616] [2023-02-15 22:07:57,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207424616] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:57,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1810576208] [2023-02-15 22:07:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:07:57,765 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:07:57,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-02-15 22:07:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:57,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 22:07:57,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:58,005 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:58,061 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:07:58,097 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-15 22:07:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 22:07:58,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:58,252 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 32 [2023-02-15 22:07:58,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1810576208] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:58,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:58,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2023-02-15 22:07:58,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732806737] [2023-02-15 22:07:58,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:58,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:07:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:58,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:07:58,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:07:58,296 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 22:07:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:59,050 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2023-02-15 22:07:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:07:59,050 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 54 [2023-02-15 22:07:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:59,051 INFO L225 Difference]: With dead ends: 93 [2023-02-15 22:07:59,051 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 22:07:59,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 22:07:59,052 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 162 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:59,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 314 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:07:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 22:07:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2023-02-15 22:07:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:07:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2023-02-15 22:07:59,055 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 54 [2023-02-15 22:07:59,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:59,055 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2023-02-15 22:07:59,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 22:07:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2023-02-15 22:07:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:07:59,055 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:59,055 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:59,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Ended with exit code 0 [2023-02-15 22:07:59,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Ended with exit code 0 [2023-02-15 22:07:59,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:59,461 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:07:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1825890595, now seen corresponding path program 1 times [2023-02-15 22:07:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:59,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576533088] [2023-02-15 22:07:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:59,463 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:59,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2023-02-15 22:07:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:59,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:07:59,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:59,578 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:07:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:07:59,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:07:59,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:59,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576533088] [2023-02-15 22:07:59,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576533088] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:07:59,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:59,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-15 22:07:59,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467778836] [2023-02-15 22:07:59,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:59,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:07:59,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:59,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:07:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:07:59,728 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:08:00,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:08:01,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:08:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:02,963 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2023-02-15 22:08:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:08:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2023-02-15 22:08:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:02,964 INFO L225 Difference]: With dead ends: 87 [2023-02-15 22:08:02,964 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 22:08:02,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:08:02,965 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:02,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 182 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 3 Unknown, 0 Unchecked, 3.2s Time] [2023-02-15 22:08:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 22:08:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 22:08:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 74 states have internal predecessors, (77), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:08:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2023-02-15 22:08:02,967 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 54 [2023-02-15 22:08:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:02,967 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2023-02-15 22:08:02,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:08:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2023-02-15 22:08:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:08:02,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:02,968 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:02,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:03,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:03,176 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:08:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash -653967976, now seen corresponding path program 1 times [2023-02-15 22:08:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:03,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396500855] [2023-02-15 22:08:03,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:03,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:03,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:03,178 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:08:03,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2023-02-15 22:08:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:03,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:08:03,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:03,317 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:08:03,370 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:03,371 INFO L350 Elim1Store]: Elim1 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 27 [2023-02-15 22:08:03,497 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:08:03,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:08:03,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:03,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396500855] [2023-02-15 22:08:03,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396500855] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:03,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:03,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2023-02-15 22:08:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103437743] [2023-02-15 22:08:03,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:03,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:08:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:08:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:08:03,746 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-15 22:08:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:04,093 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2023-02-15 22:08:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:08:04,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2023-02-15 22:08:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:04,098 INFO L225 Difference]: With dead ends: 90 [2023-02-15 22:08:04,098 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 22:08:04,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:08:04,099 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:04,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 234 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 333 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:08:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 22:08:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-15 22:08:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 77 states have internal predecessors, (80), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:08:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2023-02-15 22:08:04,103 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 57 [2023-02-15 22:08:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:04,104 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2023-02-15 22:08:04,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-15 22:08:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2023-02-15 22:08:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:08:04,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:04,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:04,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:04,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:04,309 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:08:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:04,309 INFO L85 PathProgramCache]: Analyzing trace with hash -472565031, now seen corresponding path program 1 times [2023-02-15 22:08:04,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:04,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593495481] [2023-02-15 22:08:04,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:04,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:04,310 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:08:04,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2023-02-15 22:08:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:04,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 22:08:04,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:04,493 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:08:04,621 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:04,621 INFO L350 Elim1Store]: Elim1 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 27 [2023-02-15 22:08:04,756 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:08:04,884 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-02-15 22:08:05,022 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 22:08:05,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:05,335 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 26 [2023-02-15 22:08:05,440 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 58 [2023-02-15 22:08:05,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593495481] [2023-02-15 22:08:05,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593495481] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [171177696] [2023-02-15 22:08:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:05,819 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:05,821 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:08:05,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2023-02-15 22:08:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:06,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-15 22:08:06,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:06,096 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:08:06,240 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:06,240 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:08:06,320 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:08:06,326 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:08:08,459 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:08:08,718 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:08:08,718 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-02-15 22:08:08,723 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 33 [2023-02-15 22:08:08,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-02-15 22:08:09,117 INFO L321 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2023-02-15 22:08:09,117 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 20 [2023-02-15 22:08:09,311 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:09,312 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:08:09,477 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:08:09,513 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-02-15 22:08:09,542 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:08:09,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:09,799 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 26 [2023-02-15 22:08:09,826 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 58 [2023-02-15 22:08:09,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:08:09,896 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 33 [2023-02-15 22:08:10,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [171177696] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:10,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:10,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 33] total 42 [2023-02-15 22:08:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483529076] [2023-02-15 22:08:10,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:10,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-15 22:08:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-15 22:08:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2516, Unknown=3, NotChecked=0, Total=2756 [2023-02-15 22:08:10,156 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 43 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-15 22:08:12,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:14,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:20,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:22,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:24,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:32,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:35,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:37,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:39,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:41,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:43,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:08:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:43,568 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2023-02-15 22:08:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 22:08:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 58 [2023-02-15 22:08:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:43,572 INFO L225 Difference]: With dead ends: 103 [2023-02-15 22:08:43,572 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 22:08:43,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=758, Invalid=6208, Unknown=6, NotChecked=0, Total=6972 [2023-02-15 22:08:43,574 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 284 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 45 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:43,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 365 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1271 Invalid, 12 Unknown, 0 Unchecked, 23.5s Time] [2023-02-15 22:08:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 22:08:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2023-02-15 22:08:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 76 states have internal predecessors, (79), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:08:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2023-02-15 22:08:43,576 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 58 [2023-02-15 22:08:43,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:43,576 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2023-02-15 22:08:43,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-15 22:08:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2023-02-15 22:08:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 22:08:43,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:43,577 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:43,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:43,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Ended with exit code 0 [2023-02-15 22:08:43,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:43,985 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:08:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash -388191190, now seen corresponding path program 1 times [2023-02-15 22:08:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:43,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437095194] [2023-02-15 22:08:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:43,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:43,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:43,987 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:08:43,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2023-02-15 22:08:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:44,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:08:44,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:44,135 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:08:44,189 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:44,189 INFO L350 Elim1Store]: Elim1 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 27 [2023-02-15 22:08:44,264 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:44,265 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 27 [2023-02-15 22:08:44,448 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:44,461 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:08:44,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:44,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:44,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437095194] [2023-02-15 22:08:44,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437095194] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:44,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [138890806] [2023-02-15 22:08:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:44,751 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:08:44,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2023-02-15 22:08:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:44,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 22:08:44,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:44,984 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:08:45,013 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:45,014 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:08:45,057 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:45,057 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-02-15 22:08:45,308 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:45,321 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 22:08:45,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:45,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:08:45,534 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 31 [2023-02-15 22:08:45,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [138890806] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:45,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:45,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 18 [2023-02-15 22:08:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633991927] [2023-02-15 22:08:45,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:45,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:08:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:45,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:08:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:08:45,583 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 22:08:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:45,964 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2023-02-15 22:08:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:08:45,965 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 60 [2023-02-15 22:08:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:45,965 INFO L225 Difference]: With dead ends: 92 [2023-02-15 22:08:45,965 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 22:08:45,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 168 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-02-15 22:08:45,966 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 93 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:45,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 244 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:08:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 22:08:45,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-15 22:08:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:08:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2023-02-15 22:08:45,968 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 60 [2023-02-15 22:08:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:45,968 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2023-02-15 22:08:45,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 22:08:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2023-02-15 22:08:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 22:08:45,969 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:45,969 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:45,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Ended with exit code 0 [2023-02-15 22:08:46,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Ended with exit code 0 [2023-02-15 22:08:46,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:46,377 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:08:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash 718077986, now seen corresponding path program 1 times [2023-02-15 22:08:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:46,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423746178] [2023-02-15 22:08:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:46,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:46,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:46,379 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:08:46,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2023-02-15 22:08:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:46,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 22:08:46,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:46,567 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:08:46,660 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:46,661 INFO L350 Elim1Store]: Elim1 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 27 [2023-02-15 22:08:46,833 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:46,833 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 27 [2023-02-15 22:08:46,992 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:08:47,153 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-02-15 22:08:47,325 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:47,365 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 22:08:47,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:47,791 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 26 [2023-02-15 22:08:47,899 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 58 [2023-02-15 22:08:48,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:48,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423746178] [2023-02-15 22:08:48,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423746178] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:48,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [798462073] [2023-02-15 22:08:48,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:48,229 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:48,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:48,230 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:08:48,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2023-02-15 22:08:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:48,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 22:08:48,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:48,558 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:08:48,607 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:48,607 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 22:08:48,766 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:48,766 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 27 [2023-02-15 22:08:48,836 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:08:48,889 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-02-15 22:08:48,950 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:48,966 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:08:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:08:48,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:49,266 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 26 [2023-02-15 22:08:49,308 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 58 [2023-02-15 22:08:49,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [798462073] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:49,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:49,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 28 [2023-02-15 22:08:49,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148260099] [2023-02-15 22:08:49,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:49,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 22:08:49,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:49,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 22:08:49,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1095, Unknown=1, NotChecked=0, Total=1260 [2023-02-15 22:08:49,518 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:50,783 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2023-02-15 22:08:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:08:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2023-02-15 22:08:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:50,784 INFO L225 Difference]: With dead ends: 98 [2023-02-15 22:08:50,784 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 22:08:50,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 131 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=339, Invalid=2012, Unknown=1, NotChecked=0, Total=2352 [2023-02-15 22:08:50,785 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 191 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:50,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 302 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 799 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:08:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 22:08:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-02-15 22:08:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.051948051948052) internal successors, (81), 78 states have internal predecessors, (81), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:08:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2023-02-15 22:08:50,787 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 61 [2023-02-15 22:08:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:50,787 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2023-02-15 22:08:50,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2023-02-15 22:08:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:08:50,788 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:50,788 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:50,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Ended with exit code 0 [2023-02-15 22:08:50,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Ended with exit code 0 [2023-02-15 22:08:51,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:51,196 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:08:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash 610425485, now seen corresponding path program 1 times [2023-02-15 22:08:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:51,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258133339] [2023-02-15 22:08:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:51,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:08:51,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:51,198 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:08:51,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2023-02-15 22:08:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:51,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:08:51,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:51,897 INFO L321 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2023-02-15 22:08:51,897 INFO L350 Elim1Store]: Elim1 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 7 case distinctions, treesize of input 100 treesize of output 116 [2023-02-15 22:09:06,546 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |ULTIMATE.start_entry_point_~c11~0#1.base|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (exists ((v_ArrVal_1362 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~fe~1#1.base| (_ BitVec 32)) (v_ArrVal_1356 (_ BitVec 1))) (let ((.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_1362))) (let ((.cse1 (store .cse3 |ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_1356))) (let ((.cse2 (store .cse1 |ULTIMATE.start_entry_point_~fe~1#1.base| (_ bv0 1)))) (let ((.cse0 (store .cse2 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (select .cse1 |ULTIMATE.start_entry_point_~fe~1#1.base|)) (not (= (_ bv0 32) |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |c_#valid| (store .cse0 |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse2 |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))) (= (_ bv0 1) (select .cse3 |ULTIMATE.start_entry_point_~cfg~1#1.base|)))))))))) is different from true [2023-02-15 22:09:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 22:09:06,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:09:06,957 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 16 [2023-02-15 22:09:06,965 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 16 [2023-02-15 22:09:13,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:09:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258133339] [2023-02-15 22:09:13,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258133339] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:09:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1200308265] [2023-02-15 22:09:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:09:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:09:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:09:13,839 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:09:13,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (59)] Waiting until timeout for monitored process [2023-02-15 22:09:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:09:14,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-15 22:09:14,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:09:16,928 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:09:17,047 INFO L321 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-02-15 22:09:17,048 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 36 [2023-02-15 22:09:17,441 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:09:17,441 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:09:17,445 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:09:18,227 INFO L321 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-02-15 22:09:18,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 75 [2023-02-15 22:09:18,432 INFO L321 Elim1Store]: treesize reduction 106, result has 32.1 percent of original size [2023-02-15 22:09:18,432 INFO L350 Elim1Store]: Elim1 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 10 case distinctions, treesize of input 139 treesize of output 173 [2023-02-15 22:09:18,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-15 22:09:18,496 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3