./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/ddv-machzwd/ddv_machzwd_inw_p.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 cd6b300b335accb35f3a48bfd0f387908f589dfb4e32ea4d19ee0b855e6625b4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:56:13,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:56:13,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:56:13,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:56:13,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:56:13,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:56:13,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:56:13,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:56:13,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:56:13,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:56:13,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:56:13,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:56:13,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:56:13,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:56:13,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:56:13,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:56:13,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:56:13,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:56:13,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:56:13,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:56:13,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:56:13,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:56:13,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:56:13,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:56:13,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:56:13,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:56:13,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:56:13,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:56:13,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:56:13,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:56:13,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:56:13,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:56:13,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:56:13,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:56:13,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:56:13,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:56:13,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:56:13,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:56:13,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:56:13,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:56:13,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:56:13,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:56:13,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:56:13,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:56:13,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:56:13,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:56:13,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:56:13,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:56:13,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:56:13,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:56:13,969 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:56:13,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:56:13,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:56:13,970 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:56:13,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:56:13,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:56:13,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:56:13,971 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:56:13,971 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:56:13,971 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:56:13,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:56:13,972 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:56:13,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:56:13,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:56:13,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:56:13,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:56:13,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:56:13,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:56:13,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:56:13,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:56:13,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:56:13,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:56:13,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd6b300b335accb35f3a48bfd0f387908f589dfb4e32ea4d19ee0b855e6625b4 [2022-02-20 23:56:14,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:56:14,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:56:14,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:56:14,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:56:14,231 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:56:14,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i [2022-02-20 23:56:14,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd7b26e6/ba5ab7042916462293e7a8f7fedda16c/FLAG1dc467462 [2022-02-20 23:56:14,863 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:56:14,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i [2022-02-20 23:56:14,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd7b26e6/ba5ab7042916462293e7a8f7fedda16c/FLAG1dc467462 [2022-02-20 23:56:15,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd7b26e6/ba5ab7042916462293e7a8f7fedda16c [2022-02-20 23:56:15,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:56:15,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:56:15,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:56:15,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:56:15,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:56:15,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:15" (1/1) ... [2022-02-20 23:56:15,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b25229d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:15, skipping insertion in model container [2022-02-20 23:56:15,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:15" (1/1) ... [2022-02-20 23:56:15,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:56:15,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:56:15,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i[457,470] [2022-02-20 23:56:16,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:56:16,430 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:56:16,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c79aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:16, skipping insertion in model container [2022-02-20 23:56:16,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:56:16,431 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:56:16,433 INFO L158 Benchmark]: Toolchain (without parser) took 1126.66ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 62.6MB in the beginning and 84.1MB in the end (delta: -21.5MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-02-20 23:56:16,434 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:56:16,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1122.36ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 62.3MB in the beginning and 84.7MB in the end (delta: -22.3MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-02-20 23:56:16,436 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1122.36ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 62.3MB in the beginning and 84.7MB in the end (delta: -22.3MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2977]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/ddv-machzwd/ddv_machzwd_inw_p.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 cd6b300b335accb35f3a48bfd0f387908f589dfb4e32ea4d19ee0b855e6625b4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:56:18,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:56:18,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:56:18,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:56:18,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:56:18,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:56:18,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:56:18,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:56:18,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:56:18,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:56:18,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:56:18,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:56:18,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:56:18,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:56:18,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:56:18,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:56:18,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:56:18,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:56:18,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:56:18,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:56:18,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:56:18,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:56:18,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:56:18,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:56:18,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:56:18,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:56:18,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:56:18,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:56:18,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:56:18,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:56:18,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:56:18,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:56:18,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:56:18,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:56:18,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:56:18,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:56:18,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:56:18,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:56:18,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:56:18,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:56:18,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:56:18,168 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:56:18,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:56:18,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:56:18,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:56:18,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:56:18,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:56:18,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:56:18,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:56:18,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:56:18,206 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:56:18,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:56:18,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:56:18,207 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:56:18,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:56:18,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:56:18,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:56:18,208 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:56:18,208 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:56:18,208 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:56:18,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:56:18,208 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:56:18,208 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:56:18,209 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:56:18,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:56:18,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:56:18,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:56:18,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:56:18,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:56:18,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:56:18,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:56:18,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:56:18,210 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:56:18,210 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:56:18,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:56:18,211 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd6b300b335accb35f3a48bfd0f387908f589dfb4e32ea4d19ee0b855e6625b4 [2022-02-20 23:56:18,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:56:18,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:56:18,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:56:18,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:56:18,545 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:56:18,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i [2022-02-20 23:56:18,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555fbd8ce/12fc1d8dca90431a8fe27360af68ee83/FLAGc96e98b52 [2022-02-20 23:56:19,199 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:56:19,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i [2022-02-20 23:56:19,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555fbd8ce/12fc1d8dca90431a8fe27360af68ee83/FLAGc96e98b52 [2022-02-20 23:56:19,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555fbd8ce/12fc1d8dca90431a8fe27360af68ee83 [2022-02-20 23:56:19,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:56:19,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:56:19,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:56:19,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:56:19,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:56:19,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:19" (1/1) ... [2022-02-20 23:56:19,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a529e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:19, skipping insertion in model container [2022-02-20 23:56:19,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:19" (1/1) ... [2022-02-20 23:56:19,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:56:19,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:56:19,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i[457,470] [2022-02-20 23:56:20,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:56:20,841 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:56:20,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:56:20,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i[457,470] [2022-02-20 23:56:21,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:56:21,025 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:56:21,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i[457,470] [2022-02-20 23:56:21,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:56:21,334 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:56:21,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21 WrapperNode [2022-02-20 23:56:21,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:56:21,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:56:21,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:56:21,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:56:21,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,535 INFO L137 Inliner]: procedures = 482, calls = 839, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 970 [2022-02-20 23:56:21,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:56:21,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:56:21,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:56:21,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:56:21,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:56:21,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:56:21,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:56:21,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:56:21,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (1/1) ... [2022-02-20 23:56:21,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:56:21,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:56:21,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:56:21,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:56:21,739 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2022-02-20 23:56:21,739 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2022-02-20 23:56:21,739 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT [2022-02-20 23:56:21,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT [2022-02-20 23:56:21,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 23:56:21,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2022-02-20 23:56:21,740 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 23:56:21,740 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 23:56:21,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:56:21,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-02-20 23:56:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:56:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-20 23:56:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 23:56:21,741 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 23:56:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 23:56:21,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2022-02-20 23:56:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2022-02-20 23:56:21,742 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2022-02-20 23:56:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2022-02-20 23:56:21,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2022-02-20 23:56:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:56:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2022-02-20 23:56:21,742 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2022-02-20 23:56:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:56:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:56:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 23:56:21,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 23:56:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2022-02-20 23:56:21,743 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2022-02-20 23:56:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2022-02-20 23:56:21,744 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2022-02-20 23:56:21,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:56:21,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:56:21,745 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2022-02-20 23:56:21,745 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2022-02-20 23:56:21,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 23:56:21,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:56:21,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-02-20 23:56:21,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 23:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 23:56:21,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 23:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-02-20 23:56:21,746 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-02-20 23:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-02-20 23:56:21,747 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-02-20 23:56:21,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-02-20 23:56:21,747 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2022-02-20 23:56:21,747 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2022-02-20 23:56:21,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 23:56:21,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-02-20 23:56:21,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:56:21,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:56:21,750 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2022-02-20 23:56:21,750 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2022-02-20 23:56:21,750 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-02-20 23:56:21,750 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-02-20 23:56:21,751 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-02-20 23:56:21,751 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-02-20 23:56:21,751 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2022-02-20 23:56:21,751 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2022-02-20 23:56:21,751 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2022-02-20 23:56:21,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2022-02-20 23:56:21,751 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2022-02-20 23:56:21,752 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2022-02-20 23:56:21,752 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_ULONG~X~$Pointer$~TO~C_LONG [2022-02-20 23:56:21,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_ULONG~X~$Pointer$~TO~C_LONG [2022-02-20 23:56:21,752 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2022-02-20 23:56:21,753 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2022-02-20 23:56:21,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-02-20 23:56:21,753 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2022-02-20 23:56:21,753 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2022-02-20 23:56:21,753 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 23:56:21,753 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 23:56:21,753 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_ULONG~TO~VOID [2022-02-20 23:56:21,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_ULONG~TO~VOID [2022-02-20 23:56:22,135 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:56:22,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:56:27,764 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:56:27,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:56:27,776 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:56:27,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:56:27 BoogieIcfgContainer [2022-02-20 23:56:27,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:56:27,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:56:27,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:56:27,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:56:27,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:56:19" (1/3) ... [2022-02-20 23:56:27,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1575e0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:56:27, skipping insertion in model container [2022-02-20 23:56:27,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:21" (2/3) ... [2022-02-20 23:56:27,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1575e0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:56:27, skipping insertion in model container [2022-02-20 23:56:27,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:56:27" (3/3) ... [2022-02-20 23:56:27,784 INFO L111 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inw_p.i [2022-02-20 23:56:27,788 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:56:27,788 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 205 error locations. [2022-02-20 23:56:27,820 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:56:27,825 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:56:27,825 INFO L340 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2022-02-20 23:56:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 666 states, 356 states have (on average 1.8202247191011236) internal successors, (648), 566 states have internal predecessors, (648), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-02-20 23:56:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:56:27,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:27,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:56:27,858 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting spin_lock_initErr0REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:56:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:27,862 INFO L85 PathProgramCache]: Analyzing trace with hash 333908101, now seen corresponding path program 1 times [2022-02-20 23:56:27,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:27,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933829340] [2022-02-20 23:56:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:27,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:27,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:27,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:56:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:28,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:56:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:28,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:28,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {669#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {674#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:28,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {674#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:28,377 INFO L272 TraceCheckUtils]: 2: Hoare triple {674#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {681#(and (= (select |#valid| (_ bv44 32)) (_ bv1 1)) (= |spin_lock_init_#in~lock.base| (_ bv44 32)))} is VALID [2022-02-20 23:56:28,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {681#(and (= (select |#valid| (_ bv44 32)) (_ bv1 1)) (= |spin_lock_init_#in~lock.base| (_ bv44 32)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {685#(and (= spin_lock_init_~lock.base (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} is VALID [2022-02-20 23:56:28,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {685#(and (= spin_lock_init_~lock.base (_ bv44 32)) (= (select |#valid| (_ bv44 32)) (_ bv1 1)))} assume !(1bv1 == #valid[~lock.base]); {670#false} is VALID [2022-02-20 23:56:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:56:28,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:28,380 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:28,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933829340] [2022-02-20 23:56:28,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933829340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:28,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:28,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:56:28,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128096126] [2022-02-20 23:56:28,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:56:28,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:28,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:28,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:28,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:56:28,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:56:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:56:28,443 INFO L87 Difference]: Start difference. First operand has 666 states, 356 states have (on average 1.8202247191011236) internal successors, (648), 566 states have internal predecessors, (648), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:32,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:56:34,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:56:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:42,687 INFO L93 Difference]: Finished difference Result 1204 states and 1443 transitions. [2022-02-20 23:56:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:56:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:56:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1453 transitions. [2022-02-20 23:56:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1453 transitions. [2022-02-20 23:56:42,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1453 transitions. [2022-02-20 23:56:44,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1453 edges. 1453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:44,366 INFO L225 Difference]: With dead ends: 1204 [2022-02-20 23:56:44,366 INFO L226 Difference]: Without dead ends: 1200 [2022-02-20 23:56:44,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:56:44,370 INFO L933 BasicCegarLoop]: 759 mSDtfsCounter, 687 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:44,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 2484 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1106 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-02-20 23:56:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-02-20 23:56:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 987. [2022-02-20 23:56:44,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:44,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1200 states. Second operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 23:56:44,478 INFO L74 IsIncluded]: Start isIncluded. First operand 1200 states. Second operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 23:56:44,481 INFO L87 Difference]: Start difference. First operand 1200 states. Second operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 23:56:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:44,568 INFO L93 Difference]: Finished difference Result 1200 states and 1439 transitions. [2022-02-20 23:56:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1439 transitions. [2022-02-20 23:56:44,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:44,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:44,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) Second operand 1200 states. [2022-02-20 23:56:44,583 INFO L87 Difference]: Start difference. First operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) Second operand 1200 states. [2022-02-20 23:56:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:44,665 INFO L93 Difference]: Finished difference Result 1200 states and 1439 transitions. [2022-02-20 23:56:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1439 transitions. [2022-02-20 23:56:44,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:44,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:44,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:44,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 594 states have (on average 1.803030303030303) internal successors, (1071), 814 states have internal predecessors, (1071), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 23:56:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1347 transitions. [2022-02-20 23:56:44,737 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1347 transitions. Word has length 5 [2022-02-20 23:56:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:44,738 INFO L470 AbstractCegarLoop]: Abstraction has 987 states and 1347 transitions. [2022-02-20 23:56:44,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1347 transitions. [2022-02-20 23:56:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:56:44,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:44,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:56:44,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:44,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:44,952 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting spin_lock_initErr1REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:56:44,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:44,953 INFO L85 PathProgramCache]: Analyzing trace with hash 333908102, now seen corresponding path program 1 times [2022-02-20 23:56:44,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:44,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914562798] [2022-02-20 23:56:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:44,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:44,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:44,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:44,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:56:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:45,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:56:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:45,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:45,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {5283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {5288#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |~#kernel_lock~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:45,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {5288#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |~#kernel_lock~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {5288#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |~#kernel_lock~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:45,371 INFO L272 TraceCheckUtils]: 2: Hoare triple {5288#(and (= |~#kernel_lock~0.base| (_ bv44 32)) (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |~#kernel_lock~0.offset| (_ bv0 32)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {5295#(and (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |spin_lock_init_#in~lock.base| (_ bv44 32)) (= |spin_lock_init_#in~lock.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:45,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {5295#(and (= (_ bv8 32) (select |#length| (_ bv44 32))) (= |spin_lock_init_#in~lock.base| (_ bv44 32)) (= |spin_lock_init_#in~lock.offset| (_ bv0 32)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {5299#(and (= (_ bv8 32) (select |#length| (_ bv44 32))) (= spin_lock_init_~lock.offset (_ bv0 32)) (= spin_lock_init_~lock.base (_ bv44 32)))} is VALID [2022-02-20 23:56:45,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {5299#(and (= (_ bv8 32) (select |#length| (_ bv44 32))) (= spin_lock_init_~lock.offset (_ bv0 32)) (= spin_lock_init_~lock.base (_ bv44 32)))} assume !((~bvule32(~bvadd32(4bv32, ~lock.offset), #length[~lock.base]) && ~bvule32(~lock.offset, ~bvadd32(4bv32, ~lock.offset))) && ~bvule32(0bv32, ~lock.offset)); {5284#false} is VALID [2022-02-20 23:56:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:56:45,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:45,377 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:45,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914562798] [2022-02-20 23:56:45,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914562798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:45,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:45,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:56:45,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126212140] [2022-02-20 23:56:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:45,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:56:45,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:45,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:45,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:45,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:56:45,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:56:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:56:45,406 INFO L87 Difference]: Start difference. First operand 987 states and 1347 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:49,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:56:51,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:56:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:59,405 INFO L93 Difference]: Finished difference Result 1119 states and 1439 transitions. [2022-02-20 23:56:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:56:59,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:56:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1030 transitions. [2022-02-20 23:56:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1030 transitions. [2022-02-20 23:56:59,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1030 transitions. [2022-02-20 23:57:00,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1030 edges. 1030 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:00,479 INFO L225 Difference]: With dead ends: 1119 [2022-02-20 23:57:00,480 INFO L226 Difference]: Without dead ends: 1119 [2022-02-20 23:57:00,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:57:00,481 INFO L933 BasicCegarLoop]: 840 mSDtfsCounter, 268 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:00,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 2630 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 850 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-02-20 23:57:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-02-20 23:57:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1060. [2022-02-20 23:57:00,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:00,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1119 states. Second operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:00,509 INFO L74 IsIncluded]: Start isIncluded. First operand 1119 states. Second operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:00,511 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:00,575 INFO L93 Difference]: Finished difference Result 1119 states and 1439 transitions. [2022-02-20 23:57:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1439 transitions. [2022-02-20 23:57:00,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:00,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:00,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1119 states. [2022-02-20 23:57:00,584 INFO L87 Difference]: Start difference. First operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1119 states. [2022-02-20 23:57:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:00,649 INFO L93 Difference]: Finished difference Result 1119 states and 1439 transitions. [2022-02-20 23:57:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1439 transitions. [2022-02-20 23:57:00,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:00,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:00,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:00,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 635 states have (on average 1.7653543307086614) internal successors, (1121), 856 states have internal predecessors, (1121), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1435 transitions. [2022-02-20 23:57:00,714 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1435 transitions. Word has length 5 [2022-02-20 23:57:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:00,715 INFO L470 AbstractCegarLoop]: Abstraction has 1060 states and 1435 transitions. [2022-02-20 23:57:00,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1435 transitions. [2022-02-20 23:57:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:57:00,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:00,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:00,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:57:00,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:57:00,930 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:57:00,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:00,930 INFO L85 PathProgramCache]: Analyzing trace with hash -863937403, now seen corresponding path program 1 times [2022-02-20 23:57:00,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:57:00,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155927149] [2022-02-20 23:57:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:00,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:57:00,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:57:00,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:57:00,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:57:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:01,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:57:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:01,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:01,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {9723#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,428 INFO L272 TraceCheckUtils]: 2: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32); srcloc: L4156 {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); srcloc: L4156-1 {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} assume true; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,433 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} #1159#return; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} init_kernel_~i~1#1 := 0bv32; {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32); {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} is VALID [2022-02-20 23:57:01,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {9728#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#valid| (_ bv43 32)) (_ bv1 1)))} assume !(1bv1 == #valid[~#shared_workqueue~0.base]); {9724#false} is VALID [2022-02-20 23:57:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:01,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:57:01,435 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:57:01,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155927149] [2022-02-20 23:57:01,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155927149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:01,436 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:01,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-20 23:57:01,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678459177] [2022-02-20 23:57:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:01,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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 [2022-02-20 23:57:01,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:01,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 23:57:01,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:01,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:57:01,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:57:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:57:01,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:01,470 INFO L87 Difference]: Start difference. First operand 1060 states and 1435 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 23:57:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:06,972 INFO L93 Difference]: Finished difference Result 1266 states and 1522 transitions. [2022-02-20 23:57:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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 [2022-02-20 23:57:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 23:57:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1437 transitions. [2022-02-20 23:57:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 23:57:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1437 transitions. [2022-02-20 23:57:07,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1437 transitions. [2022-02-20 23:57:08,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1437 edges. 1437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:08,549 INFO L225 Difference]: With dead ends: 1266 [2022-02-20 23:57:08,549 INFO L226 Difference]: Without dead ends: 1266 [2022-02-20 23:57:08,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:08,550 INFO L933 BasicCegarLoop]: 742 mSDtfsCounter, 660 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:08,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 1290 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 23:57:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-02-20 23:57:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1059. [2022-02-20 23:57:08,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:08,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1266 states. Second operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:08,575 INFO L74 IsIncluded]: Start isIncluded. First operand 1266 states. Second operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:08,577 INFO L87 Difference]: Start difference. First operand 1266 states. Second operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:08,652 INFO L93 Difference]: Finished difference Result 1266 states and 1522 transitions. [2022-02-20 23:57:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1522 transitions. [2022-02-20 23:57:08,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:08,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:08,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1266 states. [2022-02-20 23:57:08,661 INFO L87 Difference]: Start difference. First operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) Second operand 1266 states. [2022-02-20 23:57:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:08,737 INFO L93 Difference]: Finished difference Result 1266 states and 1522 transitions. [2022-02-20 23:57:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1522 transitions. [2022-02-20 23:57:08,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:08,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:08,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:08,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 635 states have (on average 1.75748031496063) internal successors, (1116), 855 states have internal predecessors, (1116), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-02-20 23:57:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1430 transitions. [2022-02-20 23:57:08,799 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1430 transitions. Word has length 11 [2022-02-20 23:57:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:08,800 INFO L470 AbstractCegarLoop]: Abstraction has 1059 states and 1430 transitions. [2022-02-20 23:57:08,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 23:57:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1430 transitions. [2022-02-20 23:57:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:57:08,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:08,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:08,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:09,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:57:09,015 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [spin_lock_initErr0REQUIRES_VIOLATION, spin_lock_initErr1REQUIRES_VIOLATION, spin_lock_initErr2REQUIRES_VIOLATION, spin_lock_initErr3REQUIRES_VIOLATION (and 201 more)] === [2022-02-20 23:57:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash -863937402, now seen corresponding path program 1 times [2022-02-20 23:57:09,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:57:09,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411049234] [2022-02-20 23:57:09,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:09,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:57:09,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:57:09,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:57:09,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:57:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:09,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:57:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:09,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:09,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {14615#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(44bv32, 4bv32);call #Ultimate.allocInit(31bv32, 5bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(71bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(76bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(75bv32, 7bv32);call #Ultimate.allocInit(18bv32, 8bv32);call #Ultimate.allocInit(73bv32, 9bv32);call #Ultimate.allocInit(44bv32, 10bv32);call #Ultimate.allocInit(43bv32, 11bv32);call #Ultimate.allocInit(39bv32, 12bv32);call #Ultimate.allocInit(69bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(6bv32, 15bv32);call write~init~intINTTYPE1(82bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(83bv8, 15bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(69bv8, 15bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 15bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 5bv32, 1bv32);call #Ultimate.allocInit(4bv32, 16bv32);call write~init~intINTTYPE1(83bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 16bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 16bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 17bv32);call write~init~intINTTYPE1(78bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 3bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(83bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(40bv32, 19bv32);call #Ultimate.allocInit(58bv32, 20bv32);call #Ultimate.allocInit(31bv32, 21bv32);call #Ultimate.allocInit(36bv32, 22bv32);call #Ultimate.allocInit(14bv32, 23bv32);call #Ultimate.allocInit(35bv32, 24bv32);call #Ultimate.allocInit(44bv32, 25bv32);call #Ultimate.allocInit(22bv32, 26bv32);~current_execution_context~0 := 0bv32;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := 0bv32, 0bv32;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := 0bv32, 0bv32;~jiffies~0 := 0bv32;~_ddv_module_author~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_description~0 := ~const~array~~LB~bv32~RB~bv8();~_ddv_module_license~0 := ~_ddv_module_license~0[0bv32 := 71bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[1bv32 := 80bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[2bv32 := 76bv8];~_ddv_module_license~0 := ~_ddv_module_license~0[3bv32 := 0bv8];~nowayout~0 := 0bv32;~_ddv_module_param_nowayout~0 := ~const~array~~LB~bv32~RB~bv8();~#zf_info~0.base, ~#zf_info~0.offset := 27bv32, 0bv32;call #Ultimate.allocInit(40bv32, 27bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#zf_info~0.base);call write~unchecked~intINTTYPE4(33024bv32, ~#zf_info~0.base, ~#zf_info~0.offset, 4bv32);call write~unchecked~intINTTYPE4(1bv32, ~#zf_info~0.base, ~bvadd32(4bv32, ~#zf_info~0.offset), 4bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(8bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(9bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(10bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(11bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(12bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(13bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(14bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(15bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(16bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(17bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(18bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(19bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(20bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(21bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(22bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(23bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(24bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(25bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(26bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(27bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(28bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(29bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(30bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(31bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(32bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(33bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(34bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(35bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(36bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(37bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(38bv32, ~#zf_info~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#zf_info~0.base, ~bvadd32(39bv32, ~#zf_info~0.offset), 1bv32);~action~0 := 0bv32;~_ddv_module_param_action~0 := ~const~array~~LB~bv32~RB~bv8();~zf_action~0 := 2048bv32;~#zf_is_open~0.base, ~#zf_is_open~0.offset := 28bv32, 0bv32;call #Ultimate.allocInit(4bv32, 28bv32);call write~init~intINTTYPE4(0bv32, ~#zf_is_open~0.base, ~#zf_is_open~0.offset, 4bv32);~zf_expect_close~0 := 0bv8;~#zf_lock~0.base, ~#zf_lock~0.offset := 29bv32, 0bv32;call #Ultimate.allocInit(8bv32, 29bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~#zf_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_lock~0.base, ~bvadd32(4bv32, ~#zf_lock~0.offset), 4bv32);~#zf_port_lock~0.base, ~#zf_port_lock~0.offset := 30bv32, 0bv32;call #Ultimate.allocInit(8bv32, 30bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_port_lock~0.base, ~bvadd32(4bv32, ~#zf_port_lock~0.offset), 4bv32);~#zf_timer~0.base, ~#zf_timer~0.offset := 31bv32, 0bv32;call #Ultimate.allocInit(16bv32, 31bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_timer~0.base, ~bvadd32(4bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_timer~0.base, ~bvadd32(8bv32, ~#zf_timer~0.offset), 4bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(12bv32, ~#zf_timer~0.offset), 2bv32);call write~init~intINTTYPE2(0bv16, ~#zf_timer~0.base, ~bvadd32(14bv32, ~#zf_timer~0.offset), 2bv32);~next_heartbeat~0 := 0bv32;~#zf_fops~0.base, ~#zf_fops~0.offset := 32bv32, 0bv32;call #Ultimate.allocInit(100bv32, 32bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#zf_fops~0.base);call write~unchecked~$Pointer$(0bv32, 0bv32, ~#zf_fops~0.base, ~#zf_fops~0.offset, 4bv32);call write~unchecked~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#zf_fops~0.base, ~bvadd32(4bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_write.base, #funAddr~zf_write.offset, ~#zf_fops~0.base, ~bvadd32(12bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_ioctl.base, #funAddr~zf_ioctl.offset, ~#zf_fops~0.base, ~bvadd32(24bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_open.base, #funAddr~zf_open.offset, ~#zf_fops~0.base, ~bvadd32(40bv32, ~#zf_fops~0.offset), 4bv32);call write~unchecked~$Pointer$(#funAddr~zf_close.base, #funAddr~zf_close.offset, ~#zf_fops~0.base, ~bvadd32(48bv32, ~#zf_fops~0.offset), 4bv32);~#zf_miscdev~0.base, ~#zf_miscdev~0.offset := 33bv32, 0bv32;call #Ultimate.allocInit(12bv32, 33bv32);call write~init~intINTTYPE4(130bv32, ~#zf_miscdev~0.base, ~#zf_miscdev~0.offset, 4bv32);call write~init~$Pointer$(14bv32, 0bv32, ~#zf_miscdev~0.base, ~bvadd32(4bv32, ~#zf_miscdev~0.offset), 4bv32);call write~init~$Pointer$(~#zf_fops~0.base, ~#zf_fops~0.offset, ~#zf_miscdev~0.base, ~bvadd32(8bv32, ~#zf_miscdev~0.offset), 4bv32);~#zf_notifier~0.base, ~#zf_notifier~0.offset := 34bv32, 0bv32;call #Ultimate.allocInit(12bv32, 34bv32);call write~init~$Pointer$(#funAddr~zf_notify_sys.base, #funAddr~zf_notify_sys.offset, ~#zf_notifier~0.base, ~#zf_notifier~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#zf_notifier~0.base, ~bvadd32(4bv32, ~#zf_notifier~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#zf_notifier~0.base, ~bvadd32(8bv32, ~#zf_notifier~0.offset), 4bv32);~_ddv_tmp_init~0.base, ~_ddv_tmp_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_tmp_exit~0.base, ~_ddv_tmp_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;~#fixed_cdev~0.base, ~#fixed_cdev~0.offset := 35bv32, 0bv32;call #Ultimate.allocInit(16bv32, 35bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~#fixed_cdev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#fixed_cdev~0.base, ~bvadd32(4bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(8bv32, ~#fixed_cdev~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#fixed_cdev~0.base, ~bvadd32(12bv32, ~#fixed_cdev~0.offset), 4bv32);~fixed_cdev_used~0 := 0bv32;~number_cdev_registered~0 := 0bv16;~#cdev_registered~0.base, ~#cdev_registered~0.offset := 36bv32, 0bv32;call #Ultimate.allocInit(64bv32, 36bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#cdev_registered~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#cdev_registered~0.base);~number_genhd_registered~0 := 0bv16;~number_fixed_genhd_used~0 := 0bv16;~#fixed_gendisk~0.base, ~#fixed_gendisk~0.offset := 37bv32, 0bv32;call #Ultimate.allocInit(1280bv32, 37bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_gendisk~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_gendisk~0.base);~#genhd_registered~0.base, ~#genhd_registered~0.offset := 38bv32, 0bv32;call #Ultimate.allocInit(1460bv32, 38bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#genhd_registered~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#genhd_registered~0.base);~#registered_pci_driver~0.base, ~#registered_pci_driver~0.offset := 39bv32, 0bv32;call #Ultimate.allocInit(236bv32, 39bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_pci_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#registered_pci_driver~0.base);~#registered_irq~0.base, ~#registered_irq~0.offset := 40bv32, 0bv32;call #Ultimate.allocInit(128bv32, 40bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#registered_irq~0.base);~number_tasklet_registered~0 := 0bv16;~#tasklet_registered~0.base, ~#tasklet_registered~0.offset := 41bv32, 0bv32;call #Ultimate.allocInit(6bv32, 41bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#tasklet_registered~0.base, ~#tasklet_registered~0.offset, 4bv32);call write~init~intINTTYPE2(0bv16, ~#tasklet_registered~0.base, ~bvadd32(4bv32, ~#tasklet_registered~0.offset), 2bv32);~number_timer_registered~0 := 0bv16;~#timer_registered~0.base, ~#timer_registered~0.offset := 42bv32, 0bv32;call #Ultimate.allocInit(4bv32, 42bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#timer_registered~0.base, ~#timer_registered~0.offset, 4bv32);~#shared_workqueue~0.base, ~#shared_workqueue~0.offset := 43bv32, 0bv32;call #Ultimate.allocInit(40bv32, 43bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#shared_workqueue~0.base);~#kernel_lock~0.base, ~#kernel_lock~0.offset := 44bv32, 0bv32;call #Ultimate.allocInit(8bv32, 44bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~#kernel_lock~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#kernel_lock~0.base, ~bvadd32(4bv32, ~#kernel_lock~0.offset), 4bv32);~#fixed_request_queue~0.base, ~#fixed_request_queue~0.offset := 45bv32, 0bv32;call #Ultimate.allocInit(460bv32, 45bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fixed_request_queue~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fixed_request_queue~0.base);~number_request_queue_used~0 := 0bv32;~proc_root_driver~0.base, ~proc_root_driver~0.offset := 0bv32, 0bv32;~#global_tty_driver~0.base, ~#global_tty_driver~0.offset := 46bv32, 0bv32;call #Ultimate.allocInit(200bv32, 46bv32);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#global_tty_driver~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#global_tty_driver~0.base);~ddv_ioport_request_start~0 := 0bv32;~ddv_ioport_request_len~0 := 0bv32; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret230#1;~_ddv_module_init~0.base, ~_ddv_module_init~0.offset := #funAddr~zf_init.base, #funAddr~zf_init.offset;~_ddv_module_exit~0.base, ~_ddv_module_exit~0.offset := #funAddr~zf_exit.base, #funAddr~zf_exit.offset;assume { :begin_inline_call_ddv } true;havoc call_ddv_#res#1;havoc call_ddv_#t~ret302#1, call_ddv_~err~0#1;havoc call_ddv_~err~0#1;~current_execution_context~0 := 1bv32;assume { :begin_inline_init_kernel } true;havoc init_kernel_#t~post298#1, init_kernel_#t~post299#1, init_kernel_~i~1#1;havoc init_kernel_~i~1#1; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,536 INFO L272 TraceCheckUtils]: 2: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} call spin_lock_init(~#kernel_lock~0.base, ~#kernel_lock~0.offset); {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, ~lock.base, ~lock.offset, 4bv32); srcloc: L4156 {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(0bv32, ~lock.base, ~bvadd32(4bv32, ~lock.offset), 4bv32); srcloc: L4156-1 {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume true; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,540 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} #1159#return; {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {14620#(and (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} init_kernel_~i~1#1 := 0bv32; {14645#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {14645#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume !!~bvslt32(init_kernel_~i~1#1, 10bv32); {14645#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:57:09,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {14645#(and (= |ULTIMATE.start_init_kernel_~i~1#1| (_ bv0 32)) (= |~#shared_workqueue~0.base| (_ bv43 32)) (= (select |#length| (_ bv43 32)) (_ bv40 32)) (= |~#shared_workqueue~0.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1))), #length[~#shared_workqueue~0.base]) && ~bvule32(~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(~#shared_workqueue~0.offset, ~bvmul32(4bv32, init_kernel_~i~1#1)))); {14616#false} is VALID [2022-02-20 23:57:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:09,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:57:09,543 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:57:09,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411049234] [2022-02-20 23:57:09,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411049234] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:09,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:09,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:57:09,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902973078] [2022-02-20 23:57:09,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:09,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2022-02-20 23:57:09,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:09,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2022-02-20 23:57:09,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:09,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:57:09,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:57:09,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:57:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:57:09,583 INFO L87 Difference]: Start difference. First operand 1059 states and 1430 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2022-02-20 23:57:13,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:57:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:17,467 INFO L93 Difference]: Finished difference Result 1125 states and 1445 transitions. [2022-02-20 23:57:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:57:17,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2022-02-20 23:57:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2022-02-20 23:57:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1037 transitions. [2022-02-20 23:57:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2022-02-20 23:57:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1037 transitions. [2022-02-20 23:57:17,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1037 transitions.