./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.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_test15-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:08:10,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:08:10,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:08:10,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:08:10,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:08:10,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:08:10,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:08:10,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:08:10,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:08:10,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:08:10,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:08:10,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:08:10,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:08:10,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:08:10,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:08:10,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:08:10,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:08:10,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:08:10,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:08:10,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:08:10,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:08:10,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:08:10,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:08:10,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:08:10,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:08:10,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:08:10,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:08:10,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:08:10,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:08:10,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:08:10,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:08:10,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:08:10,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:08:10,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:08:10,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:08:10,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:08:10,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:08:10,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:08:10,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:08:10,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:08:10,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:08:10,434 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:08:10,461 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:08:10,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:08:10,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:08:10,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:08:10,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:08:10,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:08:10,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:08:10,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:08:10,464 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:08:10,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:08:10,465 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:08:10,465 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:08:10,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:08:10,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:08:10,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:08:10,466 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:08:10,466 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:08:10,466 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:08:10,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:08:10,467 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:08:10,467 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:08:10,467 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:08:10,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:08:10,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:08:10,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:08:10,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:08:10,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:08:10,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:08:10,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:08:10,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:08:10,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:08:10,469 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:08:10,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:08:10,470 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:08:10,470 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 -> d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 [2023-02-15 22:08:10,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:08:10,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:08:10,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:08:10,742 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:08:10,742 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:08:10,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2023-02-15 22:08:11,833 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:08:12,071 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:08:12,072 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2023-02-15 22:08:12,085 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98061442/d38e325cddff43b2be97e392944175f0/FLAG618eb19fe [2023-02-15 22:08:12,101 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98061442/d38e325cddff43b2be97e392944175f0 [2023-02-15 22:08:12,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:08:12,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:08:12,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:08:12,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:08:12,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:08:12,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:08:12" (1/1) ... [2023-02-15 22:08:12,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2011893a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:12, skipping insertion in model container [2023-02-15 22:08:12,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:08:12" (1/1) ... [2023-02-15 22:08:12,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:08:12,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:08:12,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:08:12,539 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:08:12,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4049e7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:12, skipping insertion in model container [2023-02-15 22:08:12,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:08:12,541 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 22:08:12,543 INFO L158 Benchmark]: Toolchain (without parser) took 438.41ms. Allocated memory is still 144.7MB. Free memory was 91.8MB in the beginning and 77.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 22:08:12,544 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:08:12,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.85ms. Allocated memory is still 144.7MB. Free memory was 91.8MB in the beginning and 77.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 22:08:12,546 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.85ms. Allocated memory is still 144.7MB. Free memory was 91.8MB in the beginning and 77.6MB in the end (delta: 14.2MB). 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_test15-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:08:14,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:08:14,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:08:14,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:08:14,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:08:14,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:08:14,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:08:14,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:08:14,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:08:14,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:08:14,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:08:14,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:08:14,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:08:14,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:08:14,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:08:14,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:08:14,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:08:14,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:08:14,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:08:14,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:08:14,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:08:14,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:08:14,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:08:14,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:08:14,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:08:14,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:08:14,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:08:14,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:08:14,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:08:14,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:08:14,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:08:14,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:08:14,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:08:14,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:08:14,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:08:14,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:08:14,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:08:14,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:08:14,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:08:14,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:08:14,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:08:14,630 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:08:14,665 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:08:14,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:08:14,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:08:14,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:08:14,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:08:14,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:08:14,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:08:14,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:08:14,669 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:08:14,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:08:14,670 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:08:14,670 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:08:14,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:08:14,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:08:14,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:08:14,671 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:08:14,671 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:08:14,671 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:08:14,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:08:14,671 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:08:14,672 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:08:14,672 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:08:14,672 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:08:14,672 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:08:14,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:08:14,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:08:14,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:08:14,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:08:14,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:08:14,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:08:14,673 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:08:14,674 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:14,674 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:08:14,674 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:08:14,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:08:14,674 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:08:14,675 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:08:14,675 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 -> d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 [2023-02-15 22:08:14,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:08:15,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:08:15,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:08:15,021 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:08:15,021 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:08:15,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2023-02-15 22:08:16,279 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:08:16,506 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:08:16,507 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2023-02-15 22:08:16,530 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0d03fda/7f525e7283bb4567ae5a51fcff80e402/FLAG6fa8776db [2023-02-15 22:08:16,550 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0d03fda/7f525e7283bb4567ae5a51fcff80e402 [2023-02-15 22:08:16,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:08:16,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:08:16,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:08:16,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:08:16,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:08:16,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:08:16" (1/1) ... [2023-02-15 22:08:16,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68737a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:16, skipping insertion in model container [2023-02-15 22:08:16,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:08:16" (1/1) ... [2023-02-15 22:08:16,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:08:16,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:08:16,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:08:17,021 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 22:08:17,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:08:17,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:08:17,108 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:08:17,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:08:17,185 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:08:17,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17 WrapperNode [2023-02-15 22:08:17,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:08:17,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:08:17,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:08:17,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:08:17,193 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:08:17" (1/1) ... [2023-02-15 22:08:17,231 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:08:17" (1/1) ... [2023-02-15 22:08:17,275 INFO L138 Inliner]: procedures = 176, calls = 104, calls flagged for inlining = 31, calls inlined = 14, statements flattened = 171 [2023-02-15 22:08:17,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:08:17,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:08:17,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:08:17,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:08:17,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,357 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:08:17,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:08:17,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:08:17,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:08:17,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (1/1) ... [2023-02-15 22:08:17,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:08:17,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:08:17,398 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:08:17,430 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:08:17,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-15 22:08:17,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-15 22:08:17,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-15 22:08:17,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:08:17,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:08:17,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:08:17,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2023-02-15 22:08:17,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2023-02-15 22:08:17,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:08:17,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-15 22:08:17,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 22:08:17,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:08:17,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:08:17,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:08:17,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:08:17,684 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:08:17,686 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:08:18,241 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:08:18,249 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:08:18,250 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 22:08:18,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:08:18 BoogieIcfgContainer [2023-02-15 22:08:18,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:08:18,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:08:18,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:08:18,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:08:18,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:08:16" (1/3) ... [2023-02-15 22:08:18,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544d4534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:08:18, skipping insertion in model container [2023-02-15 22:08:18,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:17" (2/3) ... [2023-02-15 22:08:18,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544d4534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:08:18, skipping insertion in model container [2023-02-15 22:08:18,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:08:18" (3/3) ... [2023-02-15 22:08:18,258 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test15-2.i [2023-02-15 22:08:18,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:08:18,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-02-15 22:08:18,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:08:18,323 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;@138ccfa9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:08:18,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-02-15 22:08:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 127 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:08:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:08:18,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:18,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:18,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1983254393, now seen corresponding path program 1 times [2023-02-15 22:08:18,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:18,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837957191] [2023-02-15 22:08:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:18,349 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:18,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:18,352 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:08:18,357 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:08:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:18,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:08:18,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:18,509 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:08:18,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:18,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:18,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837957191] [2023-02-15 22:08:18,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837957191] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:18,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:18,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:18,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786394389] [2023-02-15 22:08:18,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:18,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:18,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:18,570 INFO L87 Difference]: Start difference. First operand has 135 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 127 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:08:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:18,691 INFO L93 Difference]: Finished difference Result 257 states and 287 transitions. [2023-02-15 22:08:18,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:18,693 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:08:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:18,702 INFO L225 Difference]: With dead ends: 257 [2023-02-15 22:08:18,703 INFO L226 Difference]: Without dead ends: 253 [2023-02-15 22:08:18,705 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:08:18,708 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 124 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:18,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 568 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:08:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-15 22:08:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2023-02-15 22:08:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.759493670886076) internal successors, (139), 128 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:08:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2023-02-15 22:08:18,780 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 11 [2023-02-15 22:08:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:18,781 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2023-02-15 22:08:18,781 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:08:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2023-02-15 22:08:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:08:18,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:18,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:18,792 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 (2)] Ended with exit code 0 [2023-02-15 22:08:18,983 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:08:18,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:18,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1095750712, now seen corresponding path program 1 times [2023-02-15 22:08:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:18,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101319111] [2023-02-15 22:08:18,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:18,985 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:18,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:18,986 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:08:18,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 (3)] Waiting until timeout for monitored process [2023-02-15 22:08:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:19,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:08:19,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:19,059 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:08:19,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:19,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:19,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101319111] [2023-02-15 22:08:19,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101319111] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:19,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:19,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:08:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447601351] [2023-02-15 22:08:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:19,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:08:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:08:19,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:08:19,063 INFO L87 Difference]: Start difference. First operand 137 states and 152 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:08:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:19,405 INFO L93 Difference]: Finished difference Result 226 states and 251 transitions. [2023-02-15 22:08:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:08:19,407 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:08:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:19,409 INFO L225 Difference]: With dead ends: 226 [2023-02-15 22:08:19,409 INFO L226 Difference]: Without dead ends: 224 [2023-02-15 22:08:19,409 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:08:19,410 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 92 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:19,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 436 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:08:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-15 22:08:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 133. [2023-02-15 22:08:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 125 states have internal predecessors, (135), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:08:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-15 22:08:19,425 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2023-02-15 22:08:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:19,425 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-15 22:08:19,425 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:08:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-15 22:08:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:08:19,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:19,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:19,441 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:08:19,634 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:08:19,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:19,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1690514833, now seen corresponding path program 1 times [2023-02-15 22:08:19,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:19,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526913212] [2023-02-15 22:08:19,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:19,636 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:19,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:19,638 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:08:19,639 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:08:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:19,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:08:19,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:19,723 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:08:19,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:19,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:19,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526913212] [2023-02-15 22:08:19,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526913212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:19,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:19,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841216378] [2023-02-15 22:08:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:19,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:19,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:19,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:19,726 INFO L87 Difference]: Start difference. First operand 133 states and 145 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:08:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:19,836 INFO L93 Difference]: Finished difference Result 250 states and 276 transitions. [2023-02-15 22:08:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:19,837 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:08:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:19,839 INFO L225 Difference]: With dead ends: 250 [2023-02-15 22:08:19,839 INFO L226 Difference]: Without dead ends: 250 [2023-02-15 22:08:19,839 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:08:19,840 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 119 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:19,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 531 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:08:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-15 22:08:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 137. [2023-02-15 22:08:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 128 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:08:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2023-02-15 22:08:19,849 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 17 [2023-02-15 22:08:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:19,850 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2023-02-15 22:08:19,850 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:08:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2023-02-15 22:08:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:08:19,851 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:19,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:19,867 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:08:20,065 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:08:20,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1719143984, now seen corresponding path program 1 times [2023-02-15 22:08:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:20,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526604592] [2023-02-15 22:08:20,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:20,067 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:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:20,068 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:08:20,069 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:08:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:20,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:08:20,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:20,200 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:08:20,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:20,263 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:08:20,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:20,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526604592] [2023-02-15 22:08:20,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526604592] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:20,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:20,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-15 22:08:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557118477] [2023-02-15 22:08:20,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:20,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:20,266 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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:08:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:20,302 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2023-02-15 22:08:20,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:20,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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:08:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:20,304 INFO L225 Difference]: With dead ends: 136 [2023-02-15 22:08:20,304 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 22:08:20,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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:08:20,314 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 118 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:20,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 420 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:08:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 22:08:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-02-15 22:08:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.7341772151898733) internal successors, (137), 127 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:08:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2023-02-15 22:08:20,328 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 17 [2023-02-15 22:08:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:20,328 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2023-02-15 22:08:20,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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:08:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2023-02-15 22:08:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:08:20,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:20,330 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:08:20,341 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:08:20,539 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:08:20,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1753856167, now seen corresponding path program 1 times [2023-02-15 22:08:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:20,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948683129] [2023-02-15 22:08:20,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:20,541 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:20,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:20,542 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:08:20,544 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:08:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:20,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:08:20,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:20,813 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:08:20,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:20,911 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:08:20,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:20,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948683129] [2023-02-15 22:08:20,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948683129] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:20,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:20,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:08:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326916483] [2023-02-15 22:08:20,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:20,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:08:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:08:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:08:20,914 INFO L87 Difference]: Start difference. First operand 136 states and 150 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:08:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:21,304 INFO L93 Difference]: Finished difference Result 348 states and 384 transitions. [2023-02-15 22:08:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:08:21,305 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:08:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:21,306 INFO L225 Difference]: With dead ends: 348 [2023-02-15 22:08:21,306 INFO L226 Difference]: Without dead ends: 348 [2023-02-15 22:08:21,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:08:21,307 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 678 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:21,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 543 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:08:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-02-15 22:08:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 165. [2023-02-15 22:08:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 104 states have (on average 1.7596153846153846) internal successors, (183), 151 states have internal predecessors, (183), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2023-02-15 22:08:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2023-02-15 22:08:21,316 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 18 [2023-02-15 22:08:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:21,317 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2023-02-15 22:08:21,317 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:08:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2023-02-15 22:08:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:08:21,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:21,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:21,330 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:08:21,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:08:21,519 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1465033454, now seen corresponding path program 1 times [2023-02-15 22:08:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:21,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629700236] [2023-02-15 22:08:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:21,520 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:21,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:21,521 INFO L229 MonitoredProcess]: Starting monitored process 7 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:21,523 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 (7)] Waiting until timeout for monitored process [2023-02-15 22:08:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:21,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:21,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:21,603 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:21,652 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:08:21,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:21,753 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:08:21,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:21,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629700236] [2023-02-15 22:08:21,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629700236] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:21,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:21,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-15 22:08:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439149822] [2023-02-15 22:08:21,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:21,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:08:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:21,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:08:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:08:21,756 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:08:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:23,551 INFO L93 Difference]: Finished difference Result 233 states and 278 transitions. [2023-02-15 22:08:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:08:23,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 19 [2023-02-15 22:08:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:23,554 INFO L225 Difference]: With dead ends: 233 [2023-02-15 22:08:23,554 INFO L226 Difference]: Without dead ends: 233 [2023-02-15 22:08:23,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:08:23,554 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 111 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:23,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 433 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 389 Invalid, 2 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 22:08:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-15 22:08:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 179. [2023-02-15 22:08:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 117 states have (on average 1.7606837606837606) internal successors, (206), 163 states have internal predecessors, (206), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-15 22:08:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2023-02-15 22:08:23,566 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 19 [2023-02-15 22:08:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:23,567 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2023-02-15 22:08:23,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:08:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2023-02-15 22:08:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:08:23,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:23,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:23,580 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 (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:23,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:23,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash 42518355, now seen corresponding path program 1 times [2023-02-15 22:08:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:23,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468710933] [2023-02-15 22:08:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:23,770 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:23,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:23,772 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:08:23,775 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:08:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:23,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:23,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:23,867 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:08:23,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:23,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:23,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468710933] [2023-02-15 22:08:23,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468710933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:23,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:23,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070095689] [2023-02-15 22:08:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:23,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:23,870 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:08:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:23,903 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2023-02-15 22:08:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:23,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 19 [2023-02-15 22:08:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:23,906 INFO L225 Difference]: With dead ends: 143 [2023-02-15 22:08:23,906 INFO L226 Difference]: Without dead ends: 139 [2023-02-15 22:08:23,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:08:23,908 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:23,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:08:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-15 22:08:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-02-15 22:08:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.6666666666666667) internal successors, (140), 129 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-15 22:08:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2023-02-15 22:08:23,913 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 19 [2023-02-15 22:08:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:23,913 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2023-02-15 22:08:23,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:08:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2023-02-15 22:08:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:08:23,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:23,917 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:23,931 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 (8)] Ended with exit code 0 [2023-02-15 22:08:24,126 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:08:24,127 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash 204799578, now seen corresponding path program 1 times [2023-02-15 22:08:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:24,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912217091] [2023-02-15 22:08:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:24,128 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:24,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:24,129 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:08:24,130 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:08:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:24,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:08:24,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:24,200 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:24,243 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:08:24,263 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:08:24,264 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:08:24,275 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:08:24,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:24,392 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:08:24,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:24,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912217091] [2023-02-15 22:08:24,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912217091] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:24,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:24,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-15 22:08:24,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955683949] [2023-02-15 22:08:24,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:24,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:08:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:24,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:08:24,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-15 22:08:24,395 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:08:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:24,853 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2023-02-15 22:08:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:08:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 22 [2023-02-15 22:08:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:24,855 INFO L225 Difference]: With dead ends: 177 [2023-02-15 22:08:24,855 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 22:08:24,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 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:08:24,856 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 106 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:24,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 433 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 362 Invalid, 0 Unknown, 188 Unchecked, 0.4s Time] [2023-02-15 22:08:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 22:08:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2023-02-15 22:08:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 101 states have (on average 1.6633663366336633) internal successors, (168), 144 states have internal predecessors, (168), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-15 22:08:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2023-02-15 22:08:24,872 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 22 [2023-02-15 22:08:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:24,872 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2023-02-15 22:08:24,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:08:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2023-02-15 22:08:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:08:24,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:24,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:24,900 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:08:25,087 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:08:25,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash 204799579, now seen corresponding path program 1 times [2023-02-15 22:08:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:25,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441591308] [2023-02-15 22:08:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:25,088 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:25,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:25,089 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:08:25,090 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:08:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:25,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:08:25,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:25,170 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:25,174 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:08:25,284 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:08:25,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:08:25,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:08:25,317 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:25,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:08:25,332 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:08:25,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:25,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:25,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441591308] [2023-02-15 22:08:25,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441591308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:25,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [229348840] [2023-02-15 22:08:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:25,502 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:25,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:25,504 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:08:25,505 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:08:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:25,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:08:25,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:25,657 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:25,663 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:08:25,711 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_45 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_45))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:08:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:08:25,729 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:08:25,736 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:25,737 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:25,741 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:08:25,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:25,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [229348840] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:25,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:25,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-15 22:08:25,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824254392] [2023-02-15 22:08:25,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:25,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:08:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:08:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=71, Unknown=2, NotChecked=34, Total=132 [2023-02-15 22:08:25,859 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:08:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:26,813 INFO L93 Difference]: Finished difference Result 292 states and 331 transitions. [2023-02-15 22:08:26,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:08:26,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2023-02-15 22:08:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:26,815 INFO L225 Difference]: With dead ends: 292 [2023-02-15 22:08:26,815 INFO L226 Difference]: Without dead ends: 292 [2023-02-15 22:08:26,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=105, Unknown=2, NotChecked=42, Total=182 [2023-02-15 22:08:26,816 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 249 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:26,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 824 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 645 Invalid, 0 Unknown, 403 Unchecked, 0.9s Time] [2023-02-15 22:08:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-02-15 22:08:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 226. [2023-02-15 22:08:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 170 states have (on average 1.6823529411764706) internal successors, (286), 213 states have internal predecessors, (286), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-02-15 22:08:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 305 transitions. [2023-02-15 22:08:26,823 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 305 transitions. Word has length 22 [2023-02-15 22:08:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:26,823 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 305 transitions. [2023-02-15 22:08:26,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:08:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2023-02-15 22:08:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:08:26,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:26,824 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:08:26,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-02-15 22:08:27,033 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:08:27,226 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:08:27,227 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash 852130837, now seen corresponding path program 1 times [2023-02-15 22:08:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:27,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574986163] [2023-02-15 22:08:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:27,228 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:27,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:27,229 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:08:27,229 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:08:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:27,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:08:27,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:27,402 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~hdev~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 1))))) is different from true [2023-02-15 22:08:27,407 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:08:27,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:27,508 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret53#1.base_19| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret53#1.base_19| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret53#1.base_19|))))) is different from false [2023-02-15 22:08:27,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:27,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574986163] [2023-02-15 22:08:27,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574986163] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:27,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1338137750] [2023-02-15 22:08:27,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:27,510 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:27,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:27,513 INFO L229 MonitoredProcess]: Starting monitored process 13 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:27,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-02-15 22:08:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:27,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:08:27,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:27,795 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:08:27,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:27,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret53#1.base_22| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret53#1.base_22|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret53#1.base_22| (_ bv0 1))))) is different from false [2023-02-15 22:08:27,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1338137750] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:27,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:27,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-15 22:08:27,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677881996] [2023-02-15 22:08:27,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:27,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:08:27,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:27,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:08:27,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2023-02-15 22:08:27,867 INFO L87 Difference]: Start difference. First operand 226 states and 305 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:08:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:28,838 INFO L93 Difference]: Finished difference Result 300 states and 384 transitions. [2023-02-15 22:08:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:08:28,839 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:08:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:28,840 INFO L225 Difference]: With dead ends: 300 [2023-02-15 22:08:28,840 INFO L226 Difference]: Without dead ends: 295 [2023-02-15 22:08:28,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2023-02-15 22:08:28,841 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 282 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:28,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 813 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 641 Invalid, 1 Unknown, 222 Unchecked, 0.8s Time] [2023-02-15 22:08:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-15 22:08:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 223. [2023-02-15 22:08:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 167 states have (on average 1.688622754491018) internal successors, (282), 210 states have internal predecessors, (282), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-02-15 22:08:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 301 transitions. [2023-02-15 22:08:28,847 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 301 transitions. Word has length 21 [2023-02-15 22:08:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:28,848 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 301 transitions. [2023-02-15 22:08:28,848 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:08:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 301 transitions. [2023-02-15 22:08:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:08:28,848 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:28,849 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:08:28,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:29,057 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:08:29,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:08:29,251 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:29,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:29,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1592151781, now seen corresponding path program 1 times [2023-02-15 22:08:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:29,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062348652] [2023-02-15 22:08:29,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:29,252 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:29,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:29,253 INFO L229 MonitoredProcess]: Starting monitored process 14 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:29,254 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 (14)] Waiting until timeout for monitored process [2023-02-15 22:08:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:29,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:29,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:29,338 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:08:29,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:29,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:29,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062348652] [2023-02-15 22:08:29,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062348652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:29,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:29,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:29,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795738057] [2023-02-15 22:08:29,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:29,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:08:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:29,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:08:29,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:29,340 INFO L87 Difference]: Start difference. First operand 223 states and 301 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:08:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:29,379 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2023-02-15 22:08:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:08:29,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 22 [2023-02-15 22:08:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:29,380 INFO L225 Difference]: With dead ends: 144 [2023-02-15 22:08:29,380 INFO L226 Difference]: Without dead ends: 142 [2023-02-15 22:08:29,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:08:29,381 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:29,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:08:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-15 22:08:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-02-15 22:08:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 95 states have (on average 1.6) internal successors, (152), 133 states have internal predecessors, (152), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2023-02-15 22:08:29,386 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 22 [2023-02-15 22:08:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:29,386 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2023-02-15 22:08:29,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:08:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2023-02-15 22:08:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:08:29,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:29,387 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:08:29,395 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 (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:29,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2097726863, now seen corresponding path program 1 times [2023-02-15 22:08:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:29,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832891644] [2023-02-15 22:08:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:29,597 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:29,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:29,598 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:08:29,600 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:08:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:29,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:29,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:29,699 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 13 treesize of output 9 [2023-02-15 22:08:29,722 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 20 treesize of output 8 [2023-02-15 22:08:29,731 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:08:29,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:29,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:29,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832891644] [2023-02-15 22:08:29,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832891644] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:29,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:29,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:08:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114719796] [2023-02-15 22:08:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:29,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:08:29,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:29,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:08:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:08:29,733 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (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:08:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:29,895 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2023-02-15 22:08:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:08:29,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-15 22:08:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:29,897 INFO L225 Difference]: With dead ends: 150 [2023-02-15 22:08:29,897 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 22:08:29,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:08:29,898 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 6 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:29,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 611 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:08:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 22:08:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2023-02-15 22:08:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 99 states have (on average 1.5757575757575757) internal successors, (156), 136 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2023-02-15 22:08:29,901 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 27 [2023-02-15 22:08:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:29,902 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2023-02-15 22:08:29,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (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:08:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2023-02-15 22:08:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:08:29,902 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:29,902 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:08:29,914 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:08:30,106 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:08:30,106 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2097724533, now seen corresponding path program 1 times [2023-02-15 22:08:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:30,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735914433] [2023-02-15 22:08:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:30,108 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:30,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:30,109 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:08:30,110 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:08:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:30,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:08:30,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:30,193 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:08:30,222 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:30,230 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:30,272 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 7 [2023-02-15 22:08:30,277 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 21 treesize of output 9 [2023-02-15 22:08:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 22:08:30,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:30,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:30,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735914433] [2023-02-15 22:08:30,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735914433] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:30,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:30,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:08:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537766512] [2023-02-15 22:08:30,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:30,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:08:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:08:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:08:30,293 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:08:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:30,642 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2023-02-15 22:08:30,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:08:30,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-15 22:08:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:30,643 INFO L225 Difference]: With dead ends: 150 [2023-02-15 22:08:30,643 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 22:08:30,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:08:30,644 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 9 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:30,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 609 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:08:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 22:08:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2023-02-15 22:08:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 138 states have internal predecessors, (159), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2023-02-15 22:08:30,648 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 27 [2023-02-15 22:08:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:30,650 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2023-02-15 22:08:30,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:08:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2023-02-15 22:08:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:08:30,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:30,652 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:08:30,662 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:08:30,862 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:08:30,862 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:30,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2097724532, now seen corresponding path program 1 times [2023-02-15 22:08:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:30,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329981344] [2023-02-15 22:08:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:30,863 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:30,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:30,864 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:08:30,865 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:08:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:30,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:08:30,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:30,936 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:30,951 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:30,973 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 23 treesize of output 11 [2023-02-15 22:08:30,986 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:08:30,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:30,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329981344] [2023-02-15 22:08:30,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329981344] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:30,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:30,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:08:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165863836] [2023-02-15 22:08:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:30,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:08:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:30,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:08:30,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:08:30,989 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:08:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:31,269 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2023-02-15 22:08:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:08:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-15 22:08:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:31,274 INFO L225 Difference]: With dead ends: 148 [2023-02-15 22:08:31,274 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 22:08:31,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:08:31,275 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:31,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 461 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:08:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 22:08:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-02-15 22:08:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.5643564356435644) internal successors, (158), 138 states have internal predecessors, (158), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2023-02-15 22:08:31,280 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 27 [2023-02-15 22:08:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:31,280 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2023-02-15 22:08:31,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:08:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2023-02-15 22:08:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:08:31,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:31,283 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] [2023-02-15 22:08:31,291 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:08:31,491 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:08:31,492 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash 290272400, now seen corresponding path program 1 times [2023-02-15 22:08:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:31,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111112065] [2023-02-15 22:08:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:31,493 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:31,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:31,494 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:08:31,497 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:08:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:31,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:08:31,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:31,789 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:08:31,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:31,858 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:08:31,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:31,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111112065] [2023-02-15 22:08:31,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111112065] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:31,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:31,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-15 22:08:31,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324255775] [2023-02-15 22:08:31,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:31,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:08:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:31,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:08:31,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:08:31,861 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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:08:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:32,121 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2023-02-15 22:08:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:08:32,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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 27 [2023-02-15 22:08:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:32,122 INFO L225 Difference]: With dead ends: 147 [2023-02-15 22:08:32,122 INFO L226 Difference]: Without dead ends: 147 [2023-02-15 22:08:32,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 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:08:32,123 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 317 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:32,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 535 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:08:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-15 22:08:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-02-15 22:08:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 137 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2023-02-15 22:08:32,128 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 27 [2023-02-15 22:08:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:32,128 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2023-02-15 22:08:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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:08:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2023-02-15 22:08:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:08:32,129 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:32,129 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] [2023-02-15 22:08:32,140 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 (18)] Ended with exit code 0 [2023-02-15 22:08:32,338 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:08:32,338 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:32,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:32,340 INFO L85 PathProgramCache]: Analyzing trace with hash 290270070, now seen corresponding path program 1 times [2023-02-15 22:08:32,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:32,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651826331] [2023-02-15 22:08:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:32,340 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:32,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:32,342 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:08:32,343 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:08:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:32,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:08:32,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:32,433 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:32,438 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:32,477 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 7 [2023-02-15 22:08:32,479 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 7 [2023-02-15 22:08:32,494 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:08:32,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:32,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:32,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651826331] [2023-02-15 22:08:32,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651826331] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:32,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:32,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:08:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424920030] [2023-02-15 22:08:32,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:32,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:08:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:32,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:08:32,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:08:32,496 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (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:08:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:32,637 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2023-02-15 22:08:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:08:32,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-15 22:08:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:32,638 INFO L225 Difference]: With dead ends: 150 [2023-02-15 22:08:32,639 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 22:08:32,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:08:32,639 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 12 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:32,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 647 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:08:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 22:08:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2023-02-15 22:08:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.5252525252525253) internal successors, (151), 133 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2023-02-15 22:08:32,648 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 27 [2023-02-15 22:08:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:32,649 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2023-02-15 22:08:32,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (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:08:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2023-02-15 22:08:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:08:32,650 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:32,650 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:08:32,661 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 (19)] Ended with exit code 0 [2023-02-15 22:08:32,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:08:32,859 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1573614038, now seen corresponding path program 1 times [2023-02-15 22:08:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:32,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786003516] [2023-02-15 22:08:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:32,860 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:32,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:32,862 INFO L229 MonitoredProcess]: Starting monitored process 20 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:32,905 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 (20)] Waiting until timeout for monitored process [2023-02-15 22:08:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:32,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 22:08:32,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:32,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 5 [2023-02-15 22:08:32,983 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:33,077 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_160 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_160))) (exists ((v_ArrVal_159 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_159))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:08:33,114 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:33,115 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:33,120 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:08:33,154 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_161 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_161))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-15 22:08:33,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:08:33,169 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:08:33,177 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:33,177 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:33,241 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:08:33,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:33,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:33,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786003516] [2023-02-15 22:08:33,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786003516] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:33,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1618852399] [2023-02-15 22:08:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:33,421 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:33,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:33,423 INFO L229 MonitoredProcess]: Starting monitored process 21 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:33,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-02-15 22:08:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:33,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 22:08:33,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:33,576 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:08:33,580 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:33,630 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_186 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_186))) (exists ((v_ArrVal_185 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_185))))) is different from true [2023-02-15 22:08:33,671 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:33,672 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:33,676 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:08:33,710 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_187 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_187))))) is different from true [2023-02-15 22:08:33,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:08:33,735 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:08:33,742 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:08:33,742 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:33,765 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:08:33,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:33,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1618852399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:33,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:33,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2023-02-15 22:08:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914551138] [2023-02-15 22:08:33,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:33,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:08:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:33,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:08:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=73, Unknown=4, NotChecked=76, Total=182 [2023-02-15 22:08:33,925 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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:08:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:34,434 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2023-02-15 22:08:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:08:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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 29 [2023-02-15 22:08:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:34,435 INFO L225 Difference]: With dead ends: 166 [2023-02-15 22:08:34,435 INFO L226 Difference]: Without dead ends: 166 [2023-02-15 22:08:34,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=107, Unknown=4, NotChecked=92, Total=240 [2023-02-15 22:08:34,436 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 156 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 685 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:34,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 335 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 404 Invalid, 0 Unknown, 685 Unchecked, 0.4s Time] [2023-02-15 22:08:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-15 22:08:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2023-02-15 22:08:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 99 states have (on average 1.5151515151515151) internal successors, (150), 132 states have internal predecessors, (150), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2023-02-15 22:08:34,439 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 29 [2023-02-15 22:08:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:34,440 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2023-02-15 22:08:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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:08:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2023-02-15 22:08:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:08:34,441 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:34,441 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, 1, 1] [2023-02-15 22:08:34,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 (20)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:34,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:34,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:34,851 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash 414602102, now seen corresponding path program 1 times [2023-02-15 22:08:34,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:34,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909532555] [2023-02-15 22:08:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:34,851 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:34,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:34,852 INFO L229 MonitoredProcess]: Starting monitored process 22 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:34,853 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 (22)] Waiting until timeout for monitored process [2023-02-15 22:08:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:34,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:08:34,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:08:34,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:08:34,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:34,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909532555] [2023-02-15 22:08:34,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909532555] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:08:34,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:08:34,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:08:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565485483] [2023-02-15 22:08:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:34,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:08:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:08:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:08:34,955 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:08:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:35,087 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2023-02-15 22:08:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:08:35,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-15 22:08:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:35,088 INFO L225 Difference]: With dead ends: 165 [2023-02-15 22:08:35,088 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 22:08:35,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:08:35,089 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 155 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:35,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 200 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:08:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 22:08:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2023-02-15 22:08:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.505050505050505) internal successors, (149), 131 states have internal predecessors, (149), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2023-02-15 22:08:35,093 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 31 [2023-02-15 22:08:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:35,093 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2023-02-15 22:08:35,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:08:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2023-02-15 22:08:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:08:35,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:35,094 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, 1, 1] [2023-02-15 22:08:35,104 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 (22)] Ended with exit code 0 [2023-02-15 22:08:35,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:35,304 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:35,304 INFO L85 PathProgramCache]: Analyzing trace with hash 414602103, now seen corresponding path program 1 times [2023-02-15 22:08:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:35,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971443924] [2023-02-15 22:08:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:35,305 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:35,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:35,306 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:08:35,307 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:08:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:35,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:08:35,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:35,451 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:08:35,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:35,533 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 8 treesize of output 6 [2023-02-15 22:08:35,650 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:08:35,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:35,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971443924] [2023-02-15 22:08:35,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971443924] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:35,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:35,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-15 22:08:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217321395] [2023-02-15 22:08:35,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:35,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:08:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:08:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:08:35,652 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:08:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:36,052 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2023-02-15 22:08:36,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:08:36,054 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2023-02-15 22:08:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:36,054 INFO L225 Difference]: With dead ends: 147 [2023-02-15 22:08:36,054 INFO L226 Difference]: Without dead ends: 147 [2023-02-15 22:08:36,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:08:36,055 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 374 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:36,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 387 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:08:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-15 22:08:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2023-02-15 22:08:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 99 states have (on average 1.494949494949495) internal successors, (148), 130 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2023-02-15 22:08:36,059 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 31 [2023-02-15 22:08:36,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:36,059 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2023-02-15 22:08:36,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:08:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2023-02-15 22:08:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:08:36,060 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:36,060 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] [2023-02-15 22:08:36,068 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:08:36,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:08:36,265 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2015159051, now seen corresponding path program 1 times [2023-02-15 22:08:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:36,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528227241] [2023-02-15 22:08:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:36,266 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:36,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:36,267 INFO L229 MonitoredProcess]: Starting monitored process 24 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:36,268 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 (24)] Waiting until timeout for monitored process [2023-02-15 22:08:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:36,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:08:36,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:36,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 7 [2023-02-15 22:08:36,425 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:08:36,427 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:36,501 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:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:08:36,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:08:36,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:36,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528227241] [2023-02-15 22:08:36,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528227241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:36,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:36,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2023-02-15 22:08:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653786300] [2023-02-15 22:08:36,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:36,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:08:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:36,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:08:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:08:36,762 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:08:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:37,205 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2023-02-15 22:08:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:08:37,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2023-02-15 22:08:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:37,206 INFO L225 Difference]: With dead ends: 167 [2023-02-15 22:08:37,206 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 22:08:37,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:08:37,207 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 178 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:37,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 439 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 405 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:08:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 22:08:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2023-02-15 22:08:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 102 states have (on average 1.4803921568627452) internal successors, (151), 133 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2023-02-15 22:08:37,210 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 31 [2023-02-15 22:08:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:37,211 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2023-02-15 22:08:37,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:08:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2023-02-15 22:08:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:08:37,211 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:37,212 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, 1, 1, 1, 1] [2023-02-15 22:08:37,222 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 (24)] Ended with exit code 0 [2023-02-15 22:08:37,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:37,422 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -999337641, now seen corresponding path program 1 times [2023-02-15 22:08:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:37,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223930375] [2023-02-15 22:08:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:37,423 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:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:37,425 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:08:37,427 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:08:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:37,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:08:37,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:37,599 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:37,637 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:08:37,660 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:08:37,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:08:37,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:37,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223930375] [2023-02-15 22:08:37,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223930375] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:37,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:08:37,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2023-02-15 22:08:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222277960] [2023-02-15 22:08:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:08:37,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:08:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:37,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:08:37,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:08:37,741 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:08:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:38,147 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2023-02-15 22:08:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:08:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-02-15 22:08:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:38,148 INFO L225 Difference]: With dead ends: 203 [2023-02-15 22:08:38,148 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 22:08:38,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:08:38,149 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 339 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:38,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 403 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:08:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 22:08:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 142. [2023-02-15 22:08:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 132 states have internal predecessors, (150), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2023-02-15 22:08:38,153 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 33 [2023-02-15 22:08:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:38,153 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2023-02-15 22:08:38,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:08:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2023-02-15 22:08:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:08:38,154 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:38,154 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, 1, 1, 1, 1] [2023-02-15 22:08:38,164 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 (25)] Ended with exit code 0 [2023-02-15 22:08:38,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:08:38,364 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash -999337640, now seen corresponding path program 1 times [2023-02-15 22:08:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:38,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040528841] [2023-02-15 22:08:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:38,365 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:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:38,366 INFO L229 MonitoredProcess]: Starting monitored process 26 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:38,367 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 (26)] Waiting until timeout for monitored process [2023-02-15 22:08:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:38,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 22:08:38,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:38,568 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:38,573 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:38,627 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 17 treesize of output 9 [2023-02-15 22:08:38,631 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:08:38,674 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:08:38,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:38,961 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 8 treesize of output 6 [2023-02-15 22:08:39,135 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:08:39,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:39,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040528841] [2023-02-15 22:08:39,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040528841] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:08:39,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:39,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2023-02-15 22:08:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255186768] [2023-02-15 22:08:39,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:39,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:08:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:08:39,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:08:39,138 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:08:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:08:40,350 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2023-02-15 22:08:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:08:40,351 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2023-02-15 22:08:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:08:40,352 INFO L225 Difference]: With dead ends: 196 [2023-02-15 22:08:40,352 INFO L226 Difference]: Without dead ends: 196 [2023-02-15 22:08:40,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:08:40,353 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 849 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:08:40,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 746 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 22:08:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-15 22:08:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 141. [2023-02-15 22:08:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 131 states have internal predecessors, (149), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:08:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2023-02-15 22:08:40,356 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 33 [2023-02-15 22:08:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:08:40,357 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2023-02-15 22:08:40,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:08:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2023-02-15 22:08:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:08:40,358 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:08:40,358 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, 1] [2023-02-15 22:08:40,377 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 (26)] Forceful destruction successful, exit code 0 [2023-02-15 22:08:40,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:40,568 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:08:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:08:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash 462409528, now seen corresponding path program 1 times [2023-02-15 22:08:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:08:40,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840807424] [2023-02-15 22:08:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:40,569 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:40,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:08:40,570 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:08:40,571 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:08:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:40,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 22:08:40,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:46,911 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~hdev~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_323 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~intf~2#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base| v_ArrVal_323))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= |c_#valid| (store (store .cse0 |ULTIMATE.start_entry_point_~intf~2#1.base| (_ bv0 1)) |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 1)))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base|)))) is different from true [2023-02-15 22:08:46,921 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:08:46,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:49,070 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret54#1.base_36| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret54#1.base_36| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret54#1.base_36|))))) is different from false [2023-02-15 22:08:49,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:08:49,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840807424] [2023-02-15 22:08:49,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840807424] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:49,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1089053530] [2023-02-15 22:08:49,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:08:49,071 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:08:49,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:08:49,073 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:08:49,078 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:08:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:08:49,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 22:08:49,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:08:55,744 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((v_ArrVal_323 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~hdev~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~intf~2#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base| v_ArrVal_323))) (let ((.cse1 (store .cse0 |ULTIMATE.start_entry_point_~intf~2#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= |c_#valid| (store .cse1 |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse1 |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (not (= |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 32)))))))) is different from true [2023-02-15 22:08:55,762 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:08:55,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:08:55,994 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:08:58,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1089053530] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:08:58,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:08:58,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2023-02-15 22:08:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241278894] [2023-02-15 22:08:58,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:08:58,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 22:08:58,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:08:58,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 22:08:58,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=635, Unknown=11, NotChecked=162, Total=930 [2023-02-15 22:08:58,294 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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:09:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:09:03,763 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2023-02-15 22:09:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:09:03,764 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 33 [2023-02-15 22:09:03,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:09:03,764 INFO L225 Difference]: With dead ends: 143 [2023-02-15 22:09:03,765 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 22:09:03,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=248, Invalid=1235, Unknown=11, NotChecked=228, Total=1722 [2023-02-15 22:09:03,766 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 125 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:09:03,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 666 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 647 Invalid, 3 Unknown, 250 Unchecked, 1.0s Time] [2023-02-15 22:09:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 22:09:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2023-02-15 22:09:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 119 states have internal predecessors, (135), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:09:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2023-02-15 22:09:03,769 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 33 [2023-02-15 22:09:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:09:03,769 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2023-02-15 22:09:03,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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:09:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2023-02-15 22:09:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:09:03,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:09:03,770 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, 1, 1, 1, 1, 1] [2023-02-15 22:09:03,784 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:09:03,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-02-15 22:09:04,178 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:09:04,179 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:09:04,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:09:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash -914695768, now seen corresponding path program 1 times [2023-02-15 22:09:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:09:04,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118722246] [2023-02-15 22:09:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:09:04,180 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:09:04,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:09:04,181 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:09:04,181 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:09:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:09:04,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 22:09:04,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:09:04,291 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:09:04,364 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:09:04,364 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:09:04,491 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 22:09:04,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-15 22:09:04,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:09:04,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:09:04,738 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 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-15 22:09:04,791 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:09:04,800 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 41 treesize of output 32 [2023-02-15 22:09:04,952 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:09:05,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:05,098 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 1 case distinctions, treesize of input 74 treesize of output 33 [2023-02-15 22:09:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:09:05,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:09:05,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv4 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1) v_ArrVal_380))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32)) |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-15 22:09:05,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:05,650 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2023-02-15 22:09:05,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:05,668 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 288 [2023-02-15 22:09:05,678 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 304 treesize of output 284 [2023-02-15 22:09:05,701 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 234 treesize of output 218 [2023-02-15 22:09:06,280 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 154 treesize of output 138 [2023-02-15 22:09:11,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:09:11,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118722246] [2023-02-15 22:09:11,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118722246] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:09:11,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [392738804] [2023-02-15 22:09:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:09:11,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:09:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:09:11,985 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:09:11,988 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:09:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:09:12,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 22:09:12,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:09:12,196 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:09:12,251 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:09:12,251 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:09:12,333 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 22:09:12,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-15 22:09:12,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:09:12,508 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:09:12,508 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 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-15 22:09:12,577 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 41 treesize of output 32 [2023-02-15 22:09:12,599 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:09:12,672 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:09:12,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:12,730 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 1 case distinctions, treesize of input 74 treesize of output 33 [2023-02-15 22:09:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:09:12,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:09:13,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:13,689 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2023-02-15 22:09:13,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:13,710 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 382 [2023-02-15 22:09:13,723 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 430 treesize of output 398 [2023-02-15 22:09:13,753 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 234 treesize of output 218 [2023-02-15 22:09:14,984 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 462 treesize of output 426 [2023-02-15 22:09:26,722 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 47 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:09:26,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [392738804] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:09:26,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:09:26,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2023-02-15 22:09:26,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671108651] [2023-02-15 22:09:26,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:09:26,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:09:26,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:09:26,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:09:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1137, Unknown=10, NotChecked=68, Total=1332 [2023-02-15 22:09:26,725 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:09:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:09:29,241 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2023-02-15 22:09:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:09:29,241 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2023-02-15 22:09:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:09:29,242 INFO L225 Difference]: With dead ends: 187 [2023-02-15 22:09:29,242 INFO L226 Difference]: Without dead ends: 187 [2023-02-15 22:09:29,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=226, Invalid=1490, Unknown=10, NotChecked=80, Total=1806 [2023-02-15 22:09:29,243 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 382 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:09:29,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 793 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 22:09:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-15 22:09:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 126. [2023-02-15 22:09:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 118 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:09:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2023-02-15 22:09:29,247 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 34 [2023-02-15 22:09:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:09:29,247 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2023-02-15 22:09:29,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:09:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2023-02-15 22:09:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:09:29,248 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:09:29,248 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, 1, 1, 1, 1, 1] [2023-02-15 22:09:29,261 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:09:29,461 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:09:29,659 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:09:29,659 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-15 22:09:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:09:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -914695767, now seen corresponding path program 1 times [2023-02-15 22:09:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:09:29,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264182800] [2023-02-15 22:09:29,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:09:29,660 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:09:29,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:09:29,661 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:09:29,663 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:09:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:09:29,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-15 22:09:29,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:09:29,779 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:09:29,863 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:09:29,863 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:09:29,944 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:09:29,986 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-02-15 22:09:29,986 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:09:30,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:09:30,052 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 13 treesize of output 9 [2023-02-15 22:09:30,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:09:30,276 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 1 case distinctions, treesize of input 56 treesize of output 53 [2023-02-15 22:09:30,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:09:30,353 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 39 treesize of output 30 [2023-02-15 22:09:30,371 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 26 [2023-02-15 22:09:30,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:09:30,644 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:09:30,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:30,649 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 3 case distinctions, treesize of input 95 treesize of output 47 [2023-02-15 22:09:30,664 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:09:30,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-15 22:09:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:09:30,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:09:31,677 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv8 32))) (.cse2 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse4 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem57#1.base| v_ArrVal_453))) (store .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv7 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem57#1.base| v_ArrVal_453))) (store .cse5 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse5 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse4) (_ bv8 32)) (select |c_#length| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem57#1.base| v_ArrVal_452))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse4)))))) is different from false [2023-02-15 22:09:31,789 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv4 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv8 32))) (.cse2 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (and (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_453))) (store .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (bvule (bvadd .cse0 (_ bv7 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_453))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5) (_ bv8 32)) (select |c_#length| (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_452))) (store .cse7 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse7 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))))))) is different from false [2023-02-15 22:09:31,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:31,885 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2023-02-15 22:09:31,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:31,898 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2023-02-15 22:09:31,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:31,923 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 584 treesize of output 576 [2023-02-15 22:09:31,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:09:31,968 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 3072 treesize of output 2982 [2023-02-15 22:09:32,009 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 3458 treesize of output 3266 [2023-02-15 22:09:32,035 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 3646 treesize of output 3446