./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1ef83f89a2480bb974b27f067785c3859d21a1e764735321272ad8be1e6dccbd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:48:18,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:48:18,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:48:18,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:48:18,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:48:18,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:48:18,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:48:18,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:48:18,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:48:18,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:48:18,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:48:18,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:48:18,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:48:18,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:48:18,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:48:18,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:48:18,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:48:18,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:48:18,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:48:18,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:48:18,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:48:18,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:48:18,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:48:18,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:48:18,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:48:18,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:48:18,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:48:18,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:48:18,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:48:18,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:48:18,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:48:18,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:48:18,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:48:18,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:48:18,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:48:18,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:48:18,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:48:18,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:48:18,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:48:18,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:48:18,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:48:18,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:48:18,815 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:48:18,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:48:18,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:48:18,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:48:18,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:48:18,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:48:18,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:48:18,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:48:18,818 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:48:18,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:48:18,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:48:18,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:48:18,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:48:18,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:48:18,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:48:18,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:48:18,820 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:48:18,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:48:18,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:48:18,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:48:18,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:48:18,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:48:18,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:48:18,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:48:18,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:48:18,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:48:18,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:48:18,824 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:48:18,824 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:48:18,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:48:18,824 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ef83f89a2480bb974b27f067785c3859d21a1e764735321272ad8be1e6dccbd [2022-02-20 21:48:19,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:48:19,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:48:19,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:48:19,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:48:19,075 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:48:19,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2022-02-20 21:48:19,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7d10131/81091a13a7c64c52a554ca1167b4c61b/FLAG95dca37fe [2022-02-20 21:48:19,783 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:48:19,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2022-02-20 21:48:19,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7d10131/81091a13a7c64c52a554ca1167b4c61b/FLAG95dca37fe [2022-02-20 21:48:20,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7d10131/81091a13a7c64c52a554ca1167b4c61b [2022-02-20 21:48:20,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:48:20,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:48:20,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:48:20,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:48:20,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:48:20,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:48:20" (1/1) ... [2022-02-20 21:48:20,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57961625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:20, skipping insertion in model container [2022-02-20 21:48:20,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:48:20" (1/1) ... [2022-02-20 21:48:20,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:48:20,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:48:21,195 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/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2022-02-20 21:48:21,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:48:21,260 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:48:21,466 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/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2022-02-20 21:48:21,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:48:21,540 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:48:21,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21 WrapperNode [2022-02-20 21:48:21,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:48:21,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:48:21,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:48:21,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:48:21,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,728 INFO L137 Inliner]: procedures = 191, calls = 829, calls flagged for inlining = 88, calls inlined = 74, statements flattened = 2144 [2022-02-20 21:48:21,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:48:21,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:48:21,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:48:21,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:48:21,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:48:21,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:48:21,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:48:21,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:48:21,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (1/1) ... [2022-02-20 21:48:21,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:48:21,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:48:21,960 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 21:48:21,982 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 21:48:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:48:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure input_event_size [2022-02-20 21:48:22,000 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event_size [2022-02-20 21:48:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:48:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:48:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:48:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2022-02-20 21:48:22,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2022-02-20 21:48:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:48:22,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:48:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-02-20 21:48:22,002 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-02-20 21:48:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-02-20 21:48:22,002 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-02-20 21:48:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_done [2022-02-20 21:48:22,002 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_done [2022-02-20 21:48:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:48:22,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:48:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 21:48:22,003 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 21:48:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:48:22,003 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:48:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_flat [2022-02-20 21:48:22,004 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_flat [2022-02-20 21:48:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:48:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 21:48:22,004 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 21:48:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-02-20 21:48:22,004 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-02-20 21:48:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:48:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:48:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure input_alloc_absinfo [2022-02-20 21:48:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure input_alloc_absinfo [2022-02-20 21:48:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-02-20 21:48:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-02-20 21:48:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:48:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:48:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_find [2022-02-20 21:48:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_find [2022-02-20 21:48:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_uinput_device [2022-02-20 21:48:22,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_uinput_device [2022-02-20 21:48:22,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:48:22,007 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_allocate_device [2022-02-20 21:48:22,007 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_allocate_device [2022-02-20 21:48:22,007 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-02-20 21:48:22,008 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-02-20 21:48:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:48:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ioctl_handler [2022-02-20 21:48:22,008 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ioctl_handler [2022-02-20 21:48:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:48:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:48:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-02-20 21:48:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ff_upload_from_user [2022-02-20 21:48:22,009 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ff_upload_from_user [2022-02-20 21:48:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_destroy_device [2022-02-20 21:48:22,010 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_destroy_device [2022-02-20 21:48:22,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:48:22,010 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_max [2022-02-20 21:48:22,011 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_max [2022-02-20 21:48:22,011 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-02-20 21:48:22,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-02-20 21:48:22,012 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-02-20 21:48:22,012 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-02-20 21:48:22,012 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-02-20 21:48:22,012 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-02-20 21:48:22,012 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2022-02-20 21:48:22,013 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2022-02-20 21:48:22,013 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_min [2022-02-20 21:48:22,013 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_min [2022-02-20 21:48:22,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:48:22,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:48:22,014 INFO L130 BoogieDeclarations]: Found specification of procedure is_compat_task [2022-02-20 21:48:22,014 INFO L138 BoogieDeclarations]: Found implementation of procedure is_compat_task [2022-02-20 21:48:22,014 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 21:48:22,014 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 21:48:22,014 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2022-02-20 21:48:22,015 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2022-02-20 21:48:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 21:48:22,015 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 21:48:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 21:48:22,015 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 21:48:22,015 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-02-20 21:48:22,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-02-20 21:48:22,016 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 21:48:22,016 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 21:48:22,016 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 21:48:22,016 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 21:48:22,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:48:22,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-02-20 21:48:22,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-02-20 21:48:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-02-20 21:48:22,017 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-02-20 21:48:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:48:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-02-20 21:48:22,018 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-02-20 21:48:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-02-20 21:48:22,019 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-02-20 21:48:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:48:22,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:48:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 21:48:22,020 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 21:48:22,446 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:48:22,448 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:48:30,267 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:48:30,280 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:48:30,280 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:48:30,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:48:30 BoogieIcfgContainer [2022-02-20 21:48:30,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:48:30,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:48:30,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:48:30,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:48:30,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:48:20" (1/3) ... [2022-02-20 21:48:30,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7629da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:48:30, skipping insertion in model container [2022-02-20 21:48:30,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:21" (2/3) ... [2022-02-20 21:48:30,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7629da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:48:30, skipping insertion in model container [2022-02-20 21:48:30,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:48:30" (3/3) ... [2022-02-20 21:48:30,289 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2022-02-20 21:48:30,292 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:48:30,293 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:48:30,332 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:48:30,337 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 21:48:30,337 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:48:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 678 states, 497 states have (on average 1.3541247484909458) internal successors, (673), 509 states have internal predecessors, (673), 137 states have call successors, (137), 42 states have call predecessors, (137), 42 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2022-02-20 21:48:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 21:48:30,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:48:30,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:48:30,381 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:48:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:48:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1437807102, now seen corresponding path program 1 times [2022-02-20 21:48:30,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:48:30,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030855046] [2022-02-20 21:48:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:48:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:48:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:30,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:48:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:30,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {681#true} assume true; {681#true} is VALID [2022-02-20 21:48:30,711 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {681#true} {683#(= ~ldv_mutex_lock~0 1)} #1634#return; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {681#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(72, 2);call #Ultimate.allocInit(9, 3);call #Ultimate.allocInit(109, 4);call #Ultimate.allocInit(27, 5);call #Ultimate.allocInit(30, 6);call #Ultimate.allocInit(7, 7);call write~init~int(117, 7, 0, 1);call write~init~int(105, 7, 1, 1);call write~init~int(110, 7, 2, 1);call write~init~int(112, 7, 3, 1);call write~init~int(117, 7, 4, 1);call write~init~int(116, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(24, 10);call #Ultimate.allocInit(15, 11);call #Ultimate.allocInit(38, 12);call #Ultimate.allocInit(7, 13);call write~init~int(117, 13, 0, 1);call write~init~int(105, 13, 1, 1);call write~init~int(110, 13, 2, 1);call write~init~int(112, 13, 3, 1);call write~init~int(117, 13, 4, 1);call write~init~int(116, 13, 5, 1);call write~init~int(0, 13, 6, 1);call #Ultimate.allocInit(54, 14);call #Ultimate.allocInit(7, 15);call write~init~int(117, 15, 0, 1);call write~init~int(105, 15, 1, 1);call write~init~int(110, 15, 2, 1);call write~init~int(112, 15, 3, 1);call write~init~int(117, 15, 4, 1);call write~init~int(116, 15, 5, 1);call write~init~int(0, 15, 6, 1);call #Ultimate.allocInit(7, 16);call write~init~int(117, 16, 0, 1);call write~init~int(105, 16, 1, 1);call write~init~int(110, 16, 2, 1);call write~init~int(112, 16, 3, 1);call write~init~int(117, 16, 4, 1);call write~init~int(116, 16, 5, 1);call write~init~int(0, 16, 6, 1);~#uinput_fops~0.base, ~#uinput_fops~0.offset := 17, 0;call #Ultimate.allocInit(216, 17);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#uinput_fops~0.base, ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#uinput_fops~0.base, 8 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_read.base, #funAddr~uinput_read.offset, ~#uinput_fops~0.base, 16 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_write.base, #funAddr~uinput_write.offset, ~#uinput_fops~0.base, 24 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 32 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 40 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 48 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_poll.base, #funAddr~uinput_poll.offset, ~#uinput_fops~0.base, 56 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_ioctl.base, #funAddr~uinput_ioctl.offset, ~#uinput_fops~0.base, 64 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_compat_ioctl.base, #funAddr~uinput_compat_ioctl.offset, ~#uinput_fops~0.base, 72 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 80 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_open.base, #funAddr~uinput_open.offset, ~#uinput_fops~0.base, 88 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 96 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_release.base, #funAddr~uinput_release.offset, ~#uinput_fops~0.base, 104 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 112 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 120 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 128 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 136 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 144 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 152 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 160 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 168 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 176 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 184 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 192 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 200 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 208 + ~#uinput_fops~0.offset, 8);~#uinput_misc~0.base, ~#uinput_misc~0.offset := 18, 0;call #Ultimate.allocInit(62, 18);call write~init~int(223, ~#uinput_misc~0.base, ~#uinput_misc~0.offset, 4);call write~init~$Pointer$(16, 0, ~#uinput_misc~0.base, 4 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(~#uinput_fops~0.base, ~#uinput_fops~0.offset, ~#uinput_misc~0.base, 12 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 20 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 28 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 36 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 44 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 52 + ~#uinput_misc~0.offset, 8);call write~init~int(0, ~#uinput_misc~0.base, 60 + ~#uinput_misc~0.offset, 2);~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_mutex_of_uinput_device~0 := 0; {681#true} is VALID [2022-02-20 21:48:30,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret477#1, main_#t~nondet478#1, main_#t~switch479#1, main_#t~ret480#1, main_#t~ret481#1, main_#t~ret482#1, main_#t~ret483#1, main_#t~ret484#1, main_#t~ret485#1, main_#t~ret486#1, main_#t~nondet487#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~res_uinput_open_15~0#1, main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset, main_~var_uinput_read_23_p2~0#1, main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset, main_~res_uinput_read_23~0#1, main_~var_uinput_write_20_p1~0#1.base, main_~var_uinput_write_20_p1~0#1.offset, main_~var_uinput_write_20_p2~0#1, main_~var_uinput_write_20_p3~0#1.base, main_~var_uinput_write_20_p3~0#1.offset, main_~res_uinput_write_20~0#1, main_~var_uinput_poll_24_p1~0#1.base, main_~var_uinput_poll_24_p1~0#1.offset, main_~var_uinput_ioctl_31_p1~0#1, main_~var_uinput_ioctl_31_p2~0#1, main_~var_uinput_compat_ioctl_32_p1~0#1, main_~var_uinput_compat_ioctl_32_p2~0#1, main_~ldv_s_uinput_fops_file_operations~0#1, main_~tmp~29#1, main_~tmp___0~16#1, main_~tmp___1~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;havoc main_~res_uinput_open_15~0#1;havoc main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset;havoc main_~var_uinput_read_23_p2~0#1;havoc main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset;havoc main_~res_uinput_read_23~0#1;havoc main_~var_uinput_write_20_p1~0#1.base, main_~var_uinput_write_20_p1~0#1.offset;havoc main_~var_uinput_write_20_p2~0#1;havoc main_~var_uinput_write_20_p3~0#1.base, main_~var_uinput_write_20_p3~0#1.offset;havoc main_~res_uinput_write_20~0#1;havoc main_~var_uinput_poll_24_p1~0#1.base, main_~var_uinput_poll_24_p1~0#1.offset;havoc main_~var_uinput_ioctl_31_p1~0#1;havoc main_~var_uinput_ioctl_31_p2~0#1;havoc main_~var_uinput_compat_ioctl_32_p1~0#1;havoc main_~var_uinput_compat_ioctl_32_p2~0#1;havoc main_~ldv_s_uinput_fops_file_operations~0#1;havoc main_~tmp~29#1;havoc main_~tmp___0~16#1;havoc main_~tmp___1~13#1;main_~ldv_s_uinput_fops_file_operations~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_mutex_of_uinput_device~0 := 1; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#(= ~ldv_mutex_lock~0 1)} assume { :end_inline_ldv_initialize } true; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,714 INFO L272 TraceCheckUtils]: 3: Hoare triple {683#(= ~ldv_mutex_lock~0 1)} call ldv_handler_precall(); {681#true} is VALID [2022-02-20 21:48:30,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {681#true} assume true; {681#true} is VALID [2022-02-20 21:48:30,715 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {681#true} {683#(= ~ldv_mutex_lock~0 1)} #1634#return; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {683#(= ~ldv_mutex_lock~0 1)} assume { :begin_inline_uinput_init } true;havoc uinput_init_#res#1;havoc uinput_init_#t~ret474#1, uinput_init_~tmp~28#1;havoc uinput_init_~tmp~28#1;assume { :begin_inline_misc_register } true;misc_register_#in~arg0#1.base, misc_register_#in~arg0#1.offset := ~#uinput_misc~0.base, ~#uinput_misc~0.offset;havoc misc_register_#res#1;havoc misc_register_#t~nondet525#1, misc_register_~arg0#1.base, misc_register_~arg0#1.offset;misc_register_~arg0#1.base, misc_register_~arg0#1.offset := misc_register_#in~arg0#1.base, misc_register_#in~arg0#1.offset;assume -2147483648 <= misc_register_#t~nondet525#1 && misc_register_#t~nondet525#1 <= 2147483647;misc_register_#res#1 := misc_register_#t~nondet525#1;havoc misc_register_#t~nondet525#1; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#(= ~ldv_mutex_lock~0 1)} uinput_init_#t~ret474#1 := misc_register_#res#1;assume { :end_inline_misc_register } true;assume -2147483648 <= uinput_init_#t~ret474#1 && uinput_init_#t~ret474#1 <= 2147483647;uinput_init_~tmp~28#1 := uinput_init_#t~ret474#1;havoc uinput_init_#t~ret474#1;uinput_init_#res#1 := uinput_init_~tmp~28#1; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#(= ~ldv_mutex_lock~0 1)} main_#t~ret477#1 := uinput_init_#res#1;assume { :end_inline_uinput_init } true;assume -2147483648 <= main_#t~ret477#1 && main_#t~ret477#1 <= 2147483647;main_~tmp~29#1 := main_#t~ret477#1;havoc main_#t~ret477#1; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(= ~ldv_mutex_lock~0 1)} assume 0 != main_~tmp~29#1; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#(= ~ldv_mutex_lock~0 1)} assume { :begin_inline_ldv_check_final_state } true; {683#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:30,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {683#(= ~ldv_mutex_lock~0 1)} assume !(1 == ~ldv_mutex_lock~0); {682#false} is VALID [2022-02-20 21:48:30,718 INFO L272 TraceCheckUtils]: 12: Hoare triple {682#false} call ldv_error(); {682#false} is VALID [2022-02-20 21:48:30,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-02-20 21:48:30,719 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 21:48:30,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:48:30,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030855046] [2022-02-20 21:48:30,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030855046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:48:30,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:48:30,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:48:30,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079767083] [2022-02-20 21:48:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:48:30,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 21:48:30,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:48:30,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:30,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:30,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:48:30,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:48:30,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:48:30,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:48:30,777 INFO L87 Difference]: Start difference. First operand has 678 states, 497 states have (on average 1.3541247484909458) internal successors, (673), 509 states have internal predecessors, (673), 137 states have call successors, (137), 42 states have call predecessors, (137), 42 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:36,395 INFO L93 Difference]: Finished difference Result 1345 states and 1897 transitions. [2022-02-20 21:48:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:48:36,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 21:48:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:48:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2022-02-20 21:48:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2022-02-20 21:48:36,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1897 transitions. [2022-02-20 21:48:38,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1897 edges. 1897 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:38,249 INFO L225 Difference]: With dead ends: 1345 [2022-02-20 21:48:38,250 INFO L226 Difference]: Without dead ends: 671 [2022-02-20 21:48:38,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 21:48:38,259 INFO L933 BasicCegarLoop]: 936 mSDtfsCounter, 928 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:48:38,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 936 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:48:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-02-20 21:48:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2022-02-20 21:48:38,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:48:38,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 671 states. Second operand has 671 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 502 states have internal predecessors, (665), 136 states have call successors, (136), 42 states have call predecessors, (136), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2022-02-20 21:48:38,338 INFO L74 IsIncluded]: Start isIncluded. First operand 671 states. Second operand has 671 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 502 states have internal predecessors, (665), 136 states have call successors, (136), 42 states have call predecessors, (136), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2022-02-20 21:48:38,342 INFO L87 Difference]: Start difference. First operand 671 states. Second operand has 671 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 502 states have internal predecessors, (665), 136 states have call successors, (136), 42 states have call predecessors, (136), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2022-02-20 21:48:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:38,381 INFO L93 Difference]: Finished difference Result 671 states and 933 transitions. [2022-02-20 21:48:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 933 transitions. [2022-02-20 21:48:38,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:38,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:48:38,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 671 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 502 states have internal predecessors, (665), 136 states have call successors, (136), 42 states have call predecessors, (136), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) Second operand 671 states. [2022-02-20 21:48:38,395 INFO L87 Difference]: Start difference. First operand has 671 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 502 states have internal predecessors, (665), 136 states have call successors, (136), 42 states have call predecessors, (136), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) Second operand 671 states. [2022-02-20 21:48:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:38,431 INFO L93 Difference]: Finished difference Result 671 states and 933 transitions. [2022-02-20 21:48:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 933 transitions. [2022-02-20 21:48:38,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:38,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:48:38,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:48:38,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:48:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 502 states have internal predecessors, (665), 136 states have call successors, (136), 42 states have call predecessors, (136), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2022-02-20 21:48:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 933 transitions. [2022-02-20 21:48:38,482 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 933 transitions. Word has length 14 [2022-02-20 21:48:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:48:38,482 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 933 transitions. [2022-02-20 21:48:38,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 933 transitions. [2022-02-20 21:48:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 21:48:38,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:48:38,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:48:38,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:48:38,484 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:48:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:48:38,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1622032166, now seen corresponding path program 1 times [2022-02-20 21:48:38,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:48:38,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932233987] [2022-02-20 21:48:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:48:38,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:48:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:48:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:38,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {4848#true} assume true; {4848#true} is VALID [2022-02-20 21:48:38,596 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {4848#true} {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} #1634#return; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {4848#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(72, 2);call #Ultimate.allocInit(9, 3);call #Ultimate.allocInit(109, 4);call #Ultimate.allocInit(27, 5);call #Ultimate.allocInit(30, 6);call #Ultimate.allocInit(7, 7);call write~init~int(117, 7, 0, 1);call write~init~int(105, 7, 1, 1);call write~init~int(110, 7, 2, 1);call write~init~int(112, 7, 3, 1);call write~init~int(117, 7, 4, 1);call write~init~int(116, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(24, 10);call #Ultimate.allocInit(15, 11);call #Ultimate.allocInit(38, 12);call #Ultimate.allocInit(7, 13);call write~init~int(117, 13, 0, 1);call write~init~int(105, 13, 1, 1);call write~init~int(110, 13, 2, 1);call write~init~int(112, 13, 3, 1);call write~init~int(117, 13, 4, 1);call write~init~int(116, 13, 5, 1);call write~init~int(0, 13, 6, 1);call #Ultimate.allocInit(54, 14);call #Ultimate.allocInit(7, 15);call write~init~int(117, 15, 0, 1);call write~init~int(105, 15, 1, 1);call write~init~int(110, 15, 2, 1);call write~init~int(112, 15, 3, 1);call write~init~int(117, 15, 4, 1);call write~init~int(116, 15, 5, 1);call write~init~int(0, 15, 6, 1);call #Ultimate.allocInit(7, 16);call write~init~int(117, 16, 0, 1);call write~init~int(105, 16, 1, 1);call write~init~int(110, 16, 2, 1);call write~init~int(112, 16, 3, 1);call write~init~int(117, 16, 4, 1);call write~init~int(116, 16, 5, 1);call write~init~int(0, 16, 6, 1);~#uinput_fops~0.base, ~#uinput_fops~0.offset := 17, 0;call #Ultimate.allocInit(216, 17);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#uinput_fops~0.base, ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#uinput_fops~0.base, 8 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_read.base, #funAddr~uinput_read.offset, ~#uinput_fops~0.base, 16 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_write.base, #funAddr~uinput_write.offset, ~#uinput_fops~0.base, 24 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 32 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 40 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 48 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_poll.base, #funAddr~uinput_poll.offset, ~#uinput_fops~0.base, 56 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_ioctl.base, #funAddr~uinput_ioctl.offset, ~#uinput_fops~0.base, 64 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_compat_ioctl.base, #funAddr~uinput_compat_ioctl.offset, ~#uinput_fops~0.base, 72 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 80 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_open.base, #funAddr~uinput_open.offset, ~#uinput_fops~0.base, 88 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 96 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_release.base, #funAddr~uinput_release.offset, ~#uinput_fops~0.base, 104 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 112 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 120 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 128 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 136 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 144 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 152 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 160 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 168 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 176 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 184 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 192 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 200 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 208 + ~#uinput_fops~0.offset, 8);~#uinput_misc~0.base, ~#uinput_misc~0.offset := 18, 0;call #Ultimate.allocInit(62, 18);call write~init~int(223, ~#uinput_misc~0.base, ~#uinput_misc~0.offset, 4);call write~init~$Pointer$(16, 0, ~#uinput_misc~0.base, 4 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(~#uinput_fops~0.base, ~#uinput_fops~0.offset, ~#uinput_misc~0.base, 12 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 20 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 28 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 36 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 44 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 52 + ~#uinput_misc~0.offset, 8);call write~init~int(0, ~#uinput_misc~0.base, 60 + ~#uinput_misc~0.offset, 2);~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_mutex_of_uinput_device~0 := 0; {4848#true} is VALID [2022-02-20 21:48:38,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {4848#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret477#1, main_#t~nondet478#1, main_#t~switch479#1, main_#t~ret480#1, main_#t~ret481#1, main_#t~ret482#1, main_#t~ret483#1, main_#t~ret484#1, main_#t~ret485#1, main_#t~ret486#1, main_#t~nondet487#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~res_uinput_open_15~0#1, main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset, main_~var_uinput_read_23_p2~0#1, main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset, main_~res_uinput_read_23~0#1, main_~var_uinput_write_20_p1~0#1.base, main_~var_uinput_write_20_p1~0#1.offset, main_~var_uinput_write_20_p2~0#1, main_~var_uinput_write_20_p3~0#1.base, main_~var_uinput_write_20_p3~0#1.offset, main_~res_uinput_write_20~0#1, main_~var_uinput_poll_24_p1~0#1.base, main_~var_uinput_poll_24_p1~0#1.offset, main_~var_uinput_ioctl_31_p1~0#1, main_~var_uinput_ioctl_31_p2~0#1, main_~var_uinput_compat_ioctl_32_p1~0#1, main_~var_uinput_compat_ioctl_32_p2~0#1, main_~ldv_s_uinput_fops_file_operations~0#1, main_~tmp~29#1, main_~tmp___0~16#1, main_~tmp___1~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;havoc main_~res_uinput_open_15~0#1;havoc main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset;havoc main_~var_uinput_read_23_p2~0#1;havoc main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset;havoc main_~res_uinput_read_23~0#1;havoc main_~var_uinput_write_20_p1~0#1.base, main_~var_uinput_write_20_p1~0#1.offset;havoc main_~var_uinput_write_20_p2~0#1;havoc main_~var_uinput_write_20_p3~0#1.base, main_~var_uinput_write_20_p3~0#1.offset;havoc main_~res_uinput_write_20~0#1;havoc main_~var_uinput_poll_24_p1~0#1.base, main_~var_uinput_poll_24_p1~0#1.offset;havoc main_~var_uinput_ioctl_31_p1~0#1;havoc main_~var_uinput_ioctl_31_p2~0#1;havoc main_~var_uinput_compat_ioctl_32_p1~0#1;havoc main_~var_uinput_compat_ioctl_32_p2~0#1;havoc main_~ldv_s_uinput_fops_file_operations~0#1;havoc main_~tmp~29#1;havoc main_~tmp___0~16#1;havoc main_~tmp___1~13#1;main_~ldv_s_uinput_fops_file_operations~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_mutex_of_uinput_device~0 := 1; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} assume { :end_inline_ldv_initialize } true; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,597 INFO L272 TraceCheckUtils]: 3: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} call ldv_handler_precall(); {4848#true} is VALID [2022-02-20 21:48:38,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {4848#true} assume true; {4848#true} is VALID [2022-02-20 21:48:38,598 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4848#true} {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} #1634#return; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} assume { :begin_inline_uinput_init } true;havoc uinput_init_#res#1;havoc uinput_init_#t~ret474#1, uinput_init_~tmp~28#1;havoc uinput_init_~tmp~28#1;assume { :begin_inline_misc_register } true;misc_register_#in~arg0#1.base, misc_register_#in~arg0#1.offset := ~#uinput_misc~0.base, ~#uinput_misc~0.offset;havoc misc_register_#res#1;havoc misc_register_#t~nondet525#1, misc_register_~arg0#1.base, misc_register_~arg0#1.offset;misc_register_~arg0#1.base, misc_register_~arg0#1.offset := misc_register_#in~arg0#1.base, misc_register_#in~arg0#1.offset;assume -2147483648 <= misc_register_#t~nondet525#1 && misc_register_#t~nondet525#1 <= 2147483647;misc_register_#res#1 := misc_register_#t~nondet525#1;havoc misc_register_#t~nondet525#1; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} uinput_init_#t~ret474#1 := misc_register_#res#1;assume { :end_inline_misc_register } true;assume -2147483648 <= uinput_init_#t~ret474#1 && uinput_init_#t~ret474#1 <= 2147483647;uinput_init_~tmp~28#1 := uinput_init_#t~ret474#1;havoc uinput_init_#t~ret474#1;uinput_init_#res#1 := uinput_init_~tmp~28#1; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} main_#t~ret477#1 := uinput_init_#res#1;assume { :end_inline_uinput_init } true;assume -2147483648 <= main_#t~ret477#1 && main_#t~ret477#1 <= 2147483647;main_~tmp~29#1 := main_#t~ret477#1;havoc main_#t~ret477#1; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 0 != main_~tmp~29#1; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} assume { :begin_inline_ldv_check_final_state } true; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 1 == ~ldv_mutex_lock~0; {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:38,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {4850#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(1 == ~ldv_mutex_mutex_of_device~0); {4849#false} is VALID [2022-02-20 21:48:38,602 INFO L272 TraceCheckUtils]: 13: Hoare triple {4849#false} call ldv_error(); {4849#false} is VALID [2022-02-20 21:48:38,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {4849#false} assume !false; {4849#false} is VALID [2022-02-20 21:48:38,602 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 21:48:38,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:48:38,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932233987] [2022-02-20 21:48:38,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932233987] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:48:38,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:48:38,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:48:38,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490807116] [2022-02-20 21:48:38,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:48:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 21:48:38,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:48:38,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:38,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:38,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:48:38,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:48:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:48:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:48:38,621 INFO L87 Difference]: Start difference. First operand 671 states and 933 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:43,810 INFO L93 Difference]: Finished difference Result 673 states and 934 transitions. [2022-02-20 21:48:43,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:48:43,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 21:48:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:48:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2022-02-20 21:48:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2022-02-20 21:48:43,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 934 transitions. [2022-02-20 21:48:44,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 934 edges. 934 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:44,691 INFO L225 Difference]: With dead ends: 673 [2022-02-20 21:48:44,691 INFO L226 Difference]: Without dead ends: 670 [2022-02-20 21:48:44,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 21:48:44,698 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 921 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:48:44,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [921 Valid, 930 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:48:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-02-20 21:48:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2022-02-20 21:48:44,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:48:44,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 670 states. Second operand has 670 states, 493 states have (on average 1.3468559837728196) internal successors, (664), 501 states have internal predecessors, (664), 135 states have call successors, (135), 42 states have call predecessors, (135), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2022-02-20 21:48:44,737 INFO L74 IsIncluded]: Start isIncluded. First operand 670 states. Second operand has 670 states, 493 states have (on average 1.3468559837728196) internal successors, (664), 501 states have internal predecessors, (664), 135 states have call successors, (135), 42 states have call predecessors, (135), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2022-02-20 21:48:44,739 INFO L87 Difference]: Start difference. First operand 670 states. Second operand has 670 states, 493 states have (on average 1.3468559837728196) internal successors, (664), 501 states have internal predecessors, (664), 135 states have call successors, (135), 42 states have call predecessors, (135), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2022-02-20 21:48:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:44,766 INFO L93 Difference]: Finished difference Result 670 states and 931 transitions. [2022-02-20 21:48:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 931 transitions. [2022-02-20 21:48:44,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:44,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:48:44,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 670 states, 493 states have (on average 1.3468559837728196) internal successors, (664), 501 states have internal predecessors, (664), 135 states have call successors, (135), 42 states have call predecessors, (135), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) Second operand 670 states. [2022-02-20 21:48:44,773 INFO L87 Difference]: Start difference. First operand has 670 states, 493 states have (on average 1.3468559837728196) internal successors, (664), 501 states have internal predecessors, (664), 135 states have call successors, (135), 42 states have call predecessors, (135), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) Second operand 670 states. [2022-02-20 21:48:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:44,801 INFO L93 Difference]: Finished difference Result 670 states and 931 transitions. [2022-02-20 21:48:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 931 transitions. [2022-02-20 21:48:44,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:44,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:48:44,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:48:44,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:48:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 493 states have (on average 1.3468559837728196) internal successors, (664), 501 states have internal predecessors, (664), 135 states have call successors, (135), 42 states have call predecessors, (135), 41 states have return successors, (132), 130 states have call predecessors, (132), 132 states have call successors, (132) [2022-02-20 21:48:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 931 transitions. [2022-02-20 21:48:44,842 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 931 transitions. Word has length 15 [2022-02-20 21:48:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:48:44,842 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 931 transitions. [2022-02-20 21:48:44,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 931 transitions. [2022-02-20 21:48:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 21:48:44,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:48:44,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:48:44,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:48:44,844 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:48:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:48:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1256920575, now seen corresponding path program 1 times [2022-02-20 21:48:44,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:48:44,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472858714] [2022-02-20 21:48:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:48:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:48:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:48:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:44,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {8072#true} assume true; {8072#true} is VALID [2022-02-20 21:48:44,917 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {8072#true} {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} #1634#return; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {8072#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(72, 2);call #Ultimate.allocInit(9, 3);call #Ultimate.allocInit(109, 4);call #Ultimate.allocInit(27, 5);call #Ultimate.allocInit(30, 6);call #Ultimate.allocInit(7, 7);call write~init~int(117, 7, 0, 1);call write~init~int(105, 7, 1, 1);call write~init~int(110, 7, 2, 1);call write~init~int(112, 7, 3, 1);call write~init~int(117, 7, 4, 1);call write~init~int(116, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(24, 10);call #Ultimate.allocInit(15, 11);call #Ultimate.allocInit(38, 12);call #Ultimate.allocInit(7, 13);call write~init~int(117, 13, 0, 1);call write~init~int(105, 13, 1, 1);call write~init~int(110, 13, 2, 1);call write~init~int(112, 13, 3, 1);call write~init~int(117, 13, 4, 1);call write~init~int(116, 13, 5, 1);call write~init~int(0, 13, 6, 1);call #Ultimate.allocInit(54, 14);call #Ultimate.allocInit(7, 15);call write~init~int(117, 15, 0, 1);call write~init~int(105, 15, 1, 1);call write~init~int(110, 15, 2, 1);call write~init~int(112, 15, 3, 1);call write~init~int(117, 15, 4, 1);call write~init~int(116, 15, 5, 1);call write~init~int(0, 15, 6, 1);call #Ultimate.allocInit(7, 16);call write~init~int(117, 16, 0, 1);call write~init~int(105, 16, 1, 1);call write~init~int(110, 16, 2, 1);call write~init~int(112, 16, 3, 1);call write~init~int(117, 16, 4, 1);call write~init~int(116, 16, 5, 1);call write~init~int(0, 16, 6, 1);~#uinput_fops~0.base, ~#uinput_fops~0.offset := 17, 0;call #Ultimate.allocInit(216, 17);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#uinput_fops~0.base, ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#uinput_fops~0.base, 8 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_read.base, #funAddr~uinput_read.offset, ~#uinput_fops~0.base, 16 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_write.base, #funAddr~uinput_write.offset, ~#uinput_fops~0.base, 24 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 32 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 40 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 48 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_poll.base, #funAddr~uinput_poll.offset, ~#uinput_fops~0.base, 56 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_ioctl.base, #funAddr~uinput_ioctl.offset, ~#uinput_fops~0.base, 64 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_compat_ioctl.base, #funAddr~uinput_compat_ioctl.offset, ~#uinput_fops~0.base, 72 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 80 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_open.base, #funAddr~uinput_open.offset, ~#uinput_fops~0.base, 88 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 96 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_release.base, #funAddr~uinput_release.offset, ~#uinput_fops~0.base, 104 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 112 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 120 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 128 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 136 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 144 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 152 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 160 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 168 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 176 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 184 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 192 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 200 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 208 + ~#uinput_fops~0.offset, 8);~#uinput_misc~0.base, ~#uinput_misc~0.offset := 18, 0;call #Ultimate.allocInit(62, 18);call write~init~int(223, ~#uinput_misc~0.base, ~#uinput_misc~0.offset, 4);call write~init~$Pointer$(16, 0, ~#uinput_misc~0.base, 4 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(~#uinput_fops~0.base, ~#uinput_fops~0.offset, ~#uinput_misc~0.base, 12 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 20 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 28 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 36 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 44 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 52 + ~#uinput_misc~0.offset, 8);call write~init~int(0, ~#uinput_misc~0.base, 60 + ~#uinput_misc~0.offset, 2);~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_mutex_of_uinput_device~0 := 0; {8072#true} is VALID [2022-02-20 21:48:44,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {8072#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret477#1, main_#t~nondet478#1, main_#t~switch479#1, main_#t~ret480#1, main_#t~ret481#1, main_#t~ret482#1, main_#t~ret483#1, main_#t~ret484#1, main_#t~ret485#1, main_#t~ret486#1, main_#t~nondet487#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~res_uinput_open_15~0#1, main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset, main_~var_uinput_read_23_p2~0#1, main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset, main_~res_uinput_read_23~0#1, main_~var_uinput_write_20_p1~0#1.base, main_~var_uinput_write_20_p1~0#1.offset, main_~var_uinput_write_20_p2~0#1, main_~var_uinput_write_20_p3~0#1.base, main_~var_uinput_write_20_p3~0#1.offset, main_~res_uinput_write_20~0#1, main_~var_uinput_poll_24_p1~0#1.base, main_~var_uinput_poll_24_p1~0#1.offset, main_~var_uinput_ioctl_31_p1~0#1, main_~var_uinput_ioctl_31_p2~0#1, main_~var_uinput_compat_ioctl_32_p1~0#1, main_~var_uinput_compat_ioctl_32_p2~0#1, main_~ldv_s_uinput_fops_file_operations~0#1, main_~tmp~29#1, main_~tmp___0~16#1, main_~tmp___1~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;havoc main_~res_uinput_open_15~0#1;havoc main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset;havoc main_~var_uinput_read_23_p2~0#1;havoc main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset;havoc main_~res_uinput_read_23~0#1;havoc main_~var_uinput_write_20_p1~0#1.base, main_~var_uinput_write_20_p1~0#1.offset;havoc main_~var_uinput_write_20_p2~0#1;havoc main_~var_uinput_write_20_p3~0#1.base, main_~var_uinput_write_20_p3~0#1.offset;havoc main_~res_uinput_write_20~0#1;havoc main_~var_uinput_poll_24_p1~0#1.base, main_~var_uinput_poll_24_p1~0#1.offset;havoc main_~var_uinput_ioctl_31_p1~0#1;havoc main_~var_uinput_ioctl_31_p2~0#1;havoc main_~var_uinput_compat_ioctl_32_p1~0#1;havoc main_~var_uinput_compat_ioctl_32_p2~0#1;havoc main_~ldv_s_uinput_fops_file_operations~0#1;havoc main_~tmp~29#1;havoc main_~tmp___0~16#1;havoc main_~tmp___1~13#1;main_~ldv_s_uinput_fops_file_operations~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_mutex_of_uinput_device~0 := 1; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} assume { :end_inline_ldv_initialize } true; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,918 INFO L272 TraceCheckUtils]: 3: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} call ldv_handler_precall(); {8072#true} is VALID [2022-02-20 21:48:44,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {8072#true} assume true; {8072#true} is VALID [2022-02-20 21:48:44,919 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8072#true} {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} #1634#return; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} assume { :begin_inline_uinput_init } true;havoc uinput_init_#res#1;havoc uinput_init_#t~ret474#1, uinput_init_~tmp~28#1;havoc uinput_init_~tmp~28#1;assume { :begin_inline_misc_register } true;misc_register_#in~arg0#1.base, misc_register_#in~arg0#1.offset := ~#uinput_misc~0.base, ~#uinput_misc~0.offset;havoc misc_register_#res#1;havoc misc_register_#t~nondet525#1, misc_register_~arg0#1.base, misc_register_~arg0#1.offset;misc_register_~arg0#1.base, misc_register_~arg0#1.offset := misc_register_#in~arg0#1.base, misc_register_#in~arg0#1.offset;assume -2147483648 <= misc_register_#t~nondet525#1 && misc_register_#t~nondet525#1 <= 2147483647;misc_register_#res#1 := misc_register_#t~nondet525#1;havoc misc_register_#t~nondet525#1; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} uinput_init_#t~ret474#1 := misc_register_#res#1;assume { :end_inline_misc_register } true;assume -2147483648 <= uinput_init_#t~ret474#1 && uinput_init_#t~ret474#1 <= 2147483647;uinput_init_~tmp~28#1 := uinput_init_#t~ret474#1;havoc uinput_init_#t~ret474#1;uinput_init_#res#1 := uinput_init_~tmp~28#1; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} main_#t~ret477#1 := uinput_init_#res#1;assume { :end_inline_uinput_init } true;assume -2147483648 <= main_#t~ret477#1 && main_#t~ret477#1 <= 2147483647;main_~tmp~29#1 := main_#t~ret477#1;havoc main_#t~ret477#1; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} assume 0 != main_~tmp~29#1; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} assume { :begin_inline_ldv_check_final_state } true; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} assume 1 == ~ldv_mutex_lock~0; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} assume 1 == ~ldv_mutex_mutex_of_device~0; {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} is VALID [2022-02-20 21:48:44,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {8074#(= ~ldv_mutex_mutex_of_uinput_device~0 1)} assume !(1 == ~ldv_mutex_mutex_of_uinput_device~0); {8073#false} is VALID [2022-02-20 21:48:44,923 INFO L272 TraceCheckUtils]: 14: Hoare triple {8073#false} call ldv_error(); {8073#false} is VALID [2022-02-20 21:48:44,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {8073#false} assume !false; {8073#false} is VALID [2022-02-20 21:48:44,923 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 21:48:44,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:48:44,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472858714] [2022-02-20 21:48:44,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472858714] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:48:44,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:48:44,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:48:44,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499882579] [2022-02-20 21:48:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:48:44,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 21:48:44,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:48:44,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:44,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:44,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:48:44,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:48:44,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:48:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:48:44,942 INFO L87 Difference]: Start difference. First operand 670 states and 931 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:59,617 INFO L93 Difference]: Finished difference Result 1941 states and 2720 transitions. [2022-02-20 21:48:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:48:59,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 21:48:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:48:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2720 transitions. [2022-02-20 21:48:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2720 transitions. [2022-02-20 21:48:59,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 2720 transitions. [2022-02-20 21:49:01,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2720 edges. 2720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:01,796 INFO L225 Difference]: With dead ends: 1941 [2022-02-20 21:49:01,797 INFO L226 Difference]: Without dead ends: 1271 [2022-02-20 21:49:01,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 21:49:01,806 INFO L933 BasicCegarLoop]: 1569 mSDtfsCounter, 918 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:49:01,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [918 Valid, 2422 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:49:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-02-20 21:49:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1268. [2022-02-20 21:49:01,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:49:01,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1271 states. Second operand has 1268 states, 937 states have (on average 1.3468516542155817) internal successors, (1262), 951 states have internal predecessors, (1262), 254 states have call successors, (254), 78 states have call predecessors, (254), 76 states have return successors, (258), 244 states have call predecessors, (258), 248 states have call successors, (258) [2022-02-20 21:49:01,869 INFO L74 IsIncluded]: Start isIncluded. First operand 1271 states. Second operand has 1268 states, 937 states have (on average 1.3468516542155817) internal successors, (1262), 951 states have internal predecessors, (1262), 254 states have call successors, (254), 78 states have call predecessors, (254), 76 states have return successors, (258), 244 states have call predecessors, (258), 248 states have call successors, (258) [2022-02-20 21:49:01,872 INFO L87 Difference]: Start difference. First operand 1271 states. Second operand has 1268 states, 937 states have (on average 1.3468516542155817) internal successors, (1262), 951 states have internal predecessors, (1262), 254 states have call successors, (254), 78 states have call predecessors, (254), 76 states have return successors, (258), 244 states have call predecessors, (258), 248 states have call successors, (258) [2022-02-20 21:49:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:01,958 INFO L93 Difference]: Finished difference Result 1271 states and 1776 transitions. [2022-02-20 21:49:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1776 transitions. [2022-02-20 21:49:01,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:01,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:01,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 1268 states, 937 states have (on average 1.3468516542155817) internal successors, (1262), 951 states have internal predecessors, (1262), 254 states have call successors, (254), 78 states have call predecessors, (254), 76 states have return successors, (258), 244 states have call predecessors, (258), 248 states have call successors, (258) Second operand 1271 states. [2022-02-20 21:49:01,973 INFO L87 Difference]: Start difference. First operand has 1268 states, 937 states have (on average 1.3468516542155817) internal successors, (1262), 951 states have internal predecessors, (1262), 254 states have call successors, (254), 78 states have call predecessors, (254), 76 states have return successors, (258), 244 states have call predecessors, (258), 248 states have call successors, (258) Second operand 1271 states. [2022-02-20 21:49:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:02,061 INFO L93 Difference]: Finished difference Result 1271 states and 1776 transitions. [2022-02-20 21:49:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1776 transitions. [2022-02-20 21:49:02,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:02,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:02,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:49:02,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:49:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 937 states have (on average 1.3468516542155817) internal successors, (1262), 951 states have internal predecessors, (1262), 254 states have call successors, (254), 78 states have call predecessors, (254), 76 states have return successors, (258), 244 states have call predecessors, (258), 248 states have call successors, (258) [2022-02-20 21:49:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1774 transitions. [2022-02-20 21:49:02,223 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1774 transitions. Word has length 16 [2022-02-20 21:49:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:49:02,223 INFO L470 AbstractCegarLoop]: Abstraction has 1268 states and 1774 transitions. [2022-02-20 21:49:02,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:49:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1774 transitions. [2022-02-20 21:49:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 21:49:02,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:49:02,225 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:49:02,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:49:02,226 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:49:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:49:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 769296900, now seen corresponding path program 1 times [2022-02-20 21:49:02,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:49:02,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526205570] [2022-02-20 21:49:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:49:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:49:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:49:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:02,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-02-20 21:49:02,322 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {15094#true} {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} #1634#return; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:49:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:02,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-02-20 21:49:02,331 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {15094#true} {15095#false} #1646#return; {15095#false} is VALID [2022-02-20 21:49:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:49:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:02,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {15094#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;assume -2147483648 <= #t~nondet526 && #t~nondet526 <= 2147483647;#res := #t~nondet526;havoc #t~nondet526; {15094#true} is VALID [2022-02-20 21:49:02,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-02-20 21:49:02,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15094#true} {15095#false} #1650#return; {15095#false} is VALID [2022-02-20 21:49:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 21:49:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:02,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {15110#(= ~ldv_mutex_mutex_of_uinput_device~0 |old(~ldv_mutex_mutex_of_uinput_device~0)|)} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;havoc ~nondetermined~6; {15094#true} is VALID [2022-02-20 21:49:02,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {15094#true} assume 1 == ~ldv_mutex_mutex_of_uinput_device~0; {15094#true} is VALID [2022-02-20 21:49:02,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {15094#true} assume -2147483648 <= #t~nondet508 && #t~nondet508 <= 2147483647;~nondetermined~6 := #t~nondet508;havoc #t~nondet508; {15094#true} is VALID [2022-02-20 21:49:02,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {15094#true} assume 0 != ~nondetermined~6;~ldv_mutex_mutex_of_uinput_device~0 := 2;#res := 0; {15094#true} is VALID [2022-02-20 21:49:02,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-02-20 21:49:02,361 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15094#true} {15095#false} #1652#return; {15095#false} is VALID [2022-02-20 21:49:02,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {15094#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(72, 2);call #Ultimate.allocInit(9, 3);call #Ultimate.allocInit(109, 4);call #Ultimate.allocInit(27, 5);call #Ultimate.allocInit(30, 6);call #Ultimate.allocInit(7, 7);call write~init~int(117, 7, 0, 1);call write~init~int(105, 7, 1, 1);call write~init~int(110, 7, 2, 1);call write~init~int(112, 7, 3, 1);call write~init~int(117, 7, 4, 1);call write~init~int(116, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(24, 10);call #Ultimate.allocInit(15, 11);call #Ultimate.allocInit(38, 12);call #Ultimate.allocInit(7, 13);call write~init~int(117, 13, 0, 1);call write~init~int(105, 13, 1, 1);call write~init~int(110, 13, 2, 1);call write~init~int(112, 13, 3, 1);call write~init~int(117, 13, 4, 1);call write~init~int(116, 13, 5, 1);call write~init~int(0, 13, 6, 1);call #Ultimate.allocInit(54, 14);call #Ultimate.allocInit(7, 15);call write~init~int(117, 15, 0, 1);call write~init~int(105, 15, 1, 1);call write~init~int(110, 15, 2, 1);call write~init~int(112, 15, 3, 1);call write~init~int(117, 15, 4, 1);call write~init~int(116, 15, 5, 1);call write~init~int(0, 15, 6, 1);call #Ultimate.allocInit(7, 16);call write~init~int(117, 16, 0, 1);call write~init~int(105, 16, 1, 1);call write~init~int(110, 16, 2, 1);call write~init~int(112, 16, 3, 1);call write~init~int(117, 16, 4, 1);call write~init~int(116, 16, 5, 1);call write~init~int(0, 16, 6, 1);~#uinput_fops~0.base, ~#uinput_fops~0.offset := 17, 0;call #Ultimate.allocInit(216, 17);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#uinput_fops~0.base, ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~no_llseek.base, #funAddr~no_llseek.offset, ~#uinput_fops~0.base, 8 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_read.base, #funAddr~uinput_read.offset, ~#uinput_fops~0.base, 16 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_write.base, #funAddr~uinput_write.offset, ~#uinput_fops~0.base, 24 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 32 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 40 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 48 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_poll.base, #funAddr~uinput_poll.offset, ~#uinput_fops~0.base, 56 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_ioctl.base, #funAddr~uinput_ioctl.offset, ~#uinput_fops~0.base, 64 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_compat_ioctl.base, #funAddr~uinput_compat_ioctl.offset, ~#uinput_fops~0.base, 72 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 80 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_open.base, #funAddr~uinput_open.offset, ~#uinput_fops~0.base, 88 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 96 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~uinput_release.base, #funAddr~uinput_release.offset, ~#uinput_fops~0.base, 104 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 112 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 120 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 128 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 136 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 144 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 152 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 160 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 168 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 176 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 184 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 192 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 200 + ~#uinput_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_fops~0.base, 208 + ~#uinput_fops~0.offset, 8);~#uinput_misc~0.base, ~#uinput_misc~0.offset := 18, 0;call #Ultimate.allocInit(62, 18);call write~init~int(223, ~#uinput_misc~0.base, ~#uinput_misc~0.offset, 4);call write~init~$Pointer$(16, 0, ~#uinput_misc~0.base, 4 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(~#uinput_fops~0.base, ~#uinput_fops~0.offset, ~#uinput_misc~0.base, 12 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 20 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 28 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 36 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 44 + ~#uinput_misc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#uinput_misc~0.base, 52 + ~#uinput_misc~0.offset, 8);call write~init~int(0, ~#uinput_misc~0.base, 60 + ~#uinput_misc~0.offset, 2);~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_mutex_of_uinput_device~0 := 0; {15094#true} is VALID [2022-02-20 21:49:02,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {15094#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret477#1, main_#t~nondet478#1, main_#t~switch479#1, main_#t~ret480#1, main_#t~ret481#1, main_#t~ret482#1, main_#t~ret483#1, main_#t~ret484#1, main_#t~ret485#1, main_#t~ret486#1, main_#t~nondet487#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~res_uinput_open_15~0#1, main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset, main_~var_uinput_read_23_p2~0#1, main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset, main_~res_uinput_read_23~0#1, main_~var_uinput_write_20_p1~0#1.base, main_~var_uinput_write_20_p1~0#1.offset, main_~var_uinput_write_20_p2~0#1, main_~var_uinput_write_20_p3~0#1.base, main_~var_uinput_write_20_p3~0#1.offset, main_~res_uinput_write_20~0#1, main_~var_uinput_poll_24_p1~0#1.base, main_~var_uinput_poll_24_p1~0#1.offset, main_~var_uinput_ioctl_31_p1~0#1, main_~var_uinput_ioctl_31_p2~0#1, main_~var_uinput_compat_ioctl_32_p1~0#1, main_~var_uinput_compat_ioctl_32_p2~0#1, main_~ldv_s_uinput_fops_file_operations~0#1, main_~tmp~29#1, main_~tmp___0~16#1, main_~tmp___1~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;havoc main_~res_uinput_open_15~0#1;havoc main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset;havoc main_~var_uinput_read_23_p2~0#1;havoc main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset;havoc main_~res_uinput_read_23~0#1;havoc main_~var_uinput_write_20_p1~0#1.base, main_~var_uinput_write_20_p1~0#1.offset;havoc main_~var_uinput_write_20_p2~0#1;havoc main_~var_uinput_write_20_p3~0#1.base, main_~var_uinput_write_20_p3~0#1.offset;havoc main_~res_uinput_write_20~0#1;havoc main_~var_uinput_poll_24_p1~0#1.base, main_~var_uinput_poll_24_p1~0#1.offset;havoc main_~var_uinput_ioctl_31_p1~0#1;havoc main_~var_uinput_ioctl_31_p2~0#1;havoc main_~var_uinput_compat_ioctl_32_p1~0#1;havoc main_~var_uinput_compat_ioctl_32_p2~0#1;havoc main_~ldv_s_uinput_fops_file_operations~0#1;havoc main_~tmp~29#1;havoc main_~tmp___0~16#1;havoc main_~tmp___1~13#1;main_~ldv_s_uinput_fops_file_operations~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_mutex_of_uinput_device~0 := 1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume { :end_inline_ldv_initialize } true; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,362 INFO L272 TraceCheckUtils]: 3: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} call ldv_handler_precall(); {15094#true} is VALID [2022-02-20 21:49:02,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-02-20 21:49:02,363 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15094#true} {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} #1634#return; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume { :begin_inline_uinput_init } true;havoc uinput_init_#res#1;havoc uinput_init_#t~ret474#1, uinput_init_~tmp~28#1;havoc uinput_init_~tmp~28#1;assume { :begin_inline_misc_register } true;misc_register_#in~arg0#1.base, misc_register_#in~arg0#1.offset := ~#uinput_misc~0.base, ~#uinput_misc~0.offset;havoc misc_register_#res#1;havoc misc_register_#t~nondet525#1, misc_register_~arg0#1.base, misc_register_~arg0#1.offset;misc_register_~arg0#1.base, misc_register_~arg0#1.offset := misc_register_#in~arg0#1.base, misc_register_#in~arg0#1.offset;assume -2147483648 <= misc_register_#t~nondet525#1 && misc_register_#t~nondet525#1 <= 2147483647;misc_register_#res#1 := misc_register_#t~nondet525#1;havoc misc_register_#t~nondet525#1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} uinput_init_#t~ret474#1 := misc_register_#res#1;assume { :end_inline_misc_register } true;assume -2147483648 <= uinput_init_#t~ret474#1 && uinput_init_#t~ret474#1 <= 2147483647;uinput_init_~tmp~28#1 := uinput_init_#t~ret474#1;havoc uinput_init_#t~ret474#1;uinput_init_#res#1 := uinput_init_~tmp~28#1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} main_#t~ret477#1 := uinput_init_#res#1;assume { :end_inline_uinput_init } true;assume -2147483648 <= main_#t~ret477#1 && main_#t~ret477#1 <= 2147483647;main_~tmp~29#1 := main_#t~ret477#1;havoc main_#t~ret477#1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume !(0 != main_~tmp~29#1); {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume -2147483648 <= main_#t~nondet487#1 && main_#t~nondet487#1 <= 2147483647;main_~tmp___1~13#1 := main_#t~nondet487#1;havoc main_#t~nondet487#1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume 0 != main_~tmp___1~13#1 || 0 != main_~ldv_s_uinput_fops_file_operations~0#1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume -2147483648 <= main_#t~nondet478#1 && main_#t~nondet478#1 <= 2147483647;main_~tmp___0~16#1 := main_#t~nondet478#1;havoc main_#t~nondet478#1;main_#t~switch479#1 := 0 == main_~tmp___0~16#1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume !main_#t~switch479#1;main_#t~switch479#1 := main_#t~switch479#1 || 1 == main_~tmp___0~16#1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume main_#t~switch479#1; {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} is VALID [2022-02-20 21:49:02,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {15096#(= |ULTIMATE.start_main_~ldv_s_uinput_fops_file_operations~0#1| 0)} assume 1 == main_~ldv_s_uinput_fops_file_operations~0#1; {15095#false} is VALID [2022-02-20 21:49:02,367 INFO L272 TraceCheckUtils]: 16: Hoare triple {15095#false} call ldv_handler_precall(); {15094#true} is VALID [2022-02-20 21:49:02,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-02-20 21:49:02,367 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15094#true} {15095#false} #1646#return; {15095#false} is VALID [2022-02-20 21:49:02,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {15095#false} assume { :begin_inline_uinput_read } true;uinput_read_#in~file#1.base, uinput_read_#in~file#1.offset, uinput_read_#in~buffer#1.base, uinput_read_#in~buffer#1.offset, uinput_read_#in~count#1, uinput_read_#in~ppos#1.base, uinput_read_#in~ppos#1.offset := main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~var_uinput_read_23_p1~0#1.base, main_~var_uinput_read_23_p1~0#1.offset, main_~var_uinput_read_23_p2~0#1, main_~var_uinput_read_23_p3~0#1.base, main_~var_uinput_read_23_p3~0#1.offset;havoc uinput_read_#res#1;havoc uinput_read_#t~mem274#1.base, uinput_read_#t~mem274#1.offset, uinput_read_#t~ret275#1, uinput_read_#t~ret276#1, uinput_read_#t~mem277#1, uinput_read_#t~mem278#1, uinput_read_#t~mem279#1, uinput_read_#t~mem280#1, uinput_read_#t~short281#1, uinput_read_#t~ret282#1, uinput_read_#t~mem283#1, uinput_read_#t~mem284#1, uinput_read_#t~mem285#1, uinput_read_#t~mem286#1, uinput_read_#t~short287#1, uinput_read_#t~ret288#1.base, uinput_read_#t~ret288#1.offset, uinput_read_#t~mem289#1, uinput_read_#t~mem290#1, uinput_read_#t~mem291#1, uinput_read_#t~short292#1, uinput_read_#t~ret293#1.base, uinput_read_#t~ret293#1.offset, uinput_read_#t~ret294#1, uinput_read_~file#1.base, uinput_read_~file#1.offset, uinput_read_~buffer#1.base, uinput_read_~buffer#1.offset, uinput_read_~count#1, uinput_read_~ppos#1.base, uinput_read_~ppos#1.offset, uinput_read_~udev~4#1.base, uinput_read_~udev~4#1.offset, uinput_read_~retval~4#1, uinput_read_~tmp~22#1, uinput_read_~tmp___0~11#1, uinput_read_~__ret~1#1, uinput_read_~#__wait~1#1.base, uinput_read_~#__wait~1#1.offset, uinput_read_~tmp___1~9#1.base, uinput_read_~tmp___1~9#1.offset, uinput_read_~tmp___2~7#1.base, uinput_read_~tmp___2~7#1.offset, uinput_read_~tmp___3~4#1;uinput_read_~file#1.base, uinput_read_~file#1.offset := uinput_read_#in~file#1.base, uinput_read_#in~file#1.offset;uinput_read_~buffer#1.base, uinput_read_~buffer#1.offset := uinput_read_#in~buffer#1.base, uinput_read_#in~buffer#1.offset;uinput_read_~count#1 := uinput_read_#in~count#1;uinput_read_~ppos#1.base, uinput_read_~ppos#1.offset := uinput_read_#in~ppos#1.base, uinput_read_#in~ppos#1.offset;havoc uinput_read_~udev~4#1.base, uinput_read_~udev~4#1.offset;havoc uinput_read_~retval~4#1;havoc uinput_read_~tmp~22#1;havoc uinput_read_~tmp___0~11#1;havoc uinput_read_~__ret~1#1;call uinput_read_~#__wait~1#1.base, uinput_read_~#__wait~1#1.offset := #Ultimate.allocOnStack(36);havoc uinput_read_~tmp___1~9#1.base, uinput_read_~tmp___1~9#1.offset;havoc uinput_read_~tmp___2~7#1.base, uinput_read_~tmp___2~7#1.offset;havoc uinput_read_~tmp___3~4#1;call uinput_read_#t~mem274#1.base, uinput_read_#t~mem274#1.offset := read~$Pointer$(uinput_read_~file#1.base, 292 + uinput_read_~file#1.offset, 8);uinput_read_~udev~4#1.base, uinput_read_~udev~4#1.offset := uinput_read_#t~mem274#1.base, uinput_read_#t~mem274#1.offset;havoc uinput_read_#t~mem274#1.base, uinput_read_#t~mem274#1.offset; {15095#false} is VALID [2022-02-20 21:49:02,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {15095#false} assume !(0 != uinput_read_~count#1 % 18446744073709551616); {15095#false} is VALID [2022-02-20 21:49:02,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {15095#false} assume { :begin_inline_ldv_mutex_lock_interruptible_10 } true;ldv_mutex_lock_interruptible_10_#in~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_10_#in~ldv_func_arg1#1.offset := uinput_read_~udev~4#1.base, 8 + uinput_read_~udev~4#1.offset;havoc ldv_mutex_lock_interruptible_10_#res#1;havoc ldv_mutex_lock_interruptible_10_#t~ret494#1, ldv_mutex_lock_interruptible_10_#t~ret495#1, ldv_mutex_lock_interruptible_10_~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_10_~ldv_func_arg1#1.offset, ldv_mutex_lock_interruptible_10_~ldv_func_res~3#1, ldv_mutex_lock_interruptible_10_~tmp~33#1, ldv_mutex_lock_interruptible_10_~tmp___0~20#1;ldv_mutex_lock_interruptible_10_~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_10_~ldv_func_arg1#1.offset := ldv_mutex_lock_interruptible_10_#in~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_10_#in~ldv_func_arg1#1.offset;havoc ldv_mutex_lock_interruptible_10_~ldv_func_res~3#1;havoc ldv_mutex_lock_interruptible_10_~tmp~33#1;havoc ldv_mutex_lock_interruptible_10_~tmp___0~20#1; {15095#false} is VALID [2022-02-20 21:49:02,369 INFO L272 TraceCheckUtils]: 22: Hoare triple {15095#false} call ldv_mutex_lock_interruptible_10_#t~ret494#1 := mutex_lock_interruptible(ldv_mutex_lock_interruptible_10_~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_10_~ldv_func_arg1#1.offset); {15094#true} is VALID [2022-02-20 21:49:02,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {15094#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;assume -2147483648 <= #t~nondet526 && #t~nondet526 <= 2147483647;#res := #t~nondet526;havoc #t~nondet526; {15094#true} is VALID [2022-02-20 21:49:02,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-02-20 21:49:02,370 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15094#true} {15095#false} #1650#return; {15095#false} is VALID [2022-02-20 21:49:02,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {15095#false} assume -2147483648 <= ldv_mutex_lock_interruptible_10_#t~ret494#1 && ldv_mutex_lock_interruptible_10_#t~ret494#1 <= 2147483647;ldv_mutex_lock_interruptible_10_~tmp~33#1 := ldv_mutex_lock_interruptible_10_#t~ret494#1;havoc ldv_mutex_lock_interruptible_10_#t~ret494#1;ldv_mutex_lock_interruptible_10_~ldv_func_res~3#1 := ldv_mutex_lock_interruptible_10_~tmp~33#1; {15095#false} is VALID [2022-02-20 21:49:02,370 INFO L272 TraceCheckUtils]: 27: Hoare triple {15095#false} call ldv_mutex_lock_interruptible_10_#t~ret495#1 := ldv_mutex_lock_interruptible_mutex_of_uinput_device(ldv_mutex_lock_interruptible_10_~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_10_~ldv_func_arg1#1.offset); {15110#(= ~ldv_mutex_mutex_of_uinput_device~0 |old(~ldv_mutex_mutex_of_uinput_device~0)|)} is VALID [2022-02-20 21:49:02,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {15110#(= ~ldv_mutex_mutex_of_uinput_device~0 |old(~ldv_mutex_mutex_of_uinput_device~0)|)} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;havoc ~nondetermined~6; {15094#true} is VALID [2022-02-20 21:49:02,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {15094#true} assume 1 == ~ldv_mutex_mutex_of_uinput_device~0; {15094#true} is VALID [2022-02-20 21:49:02,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {15094#true} assume -2147483648 <= #t~nondet508 && #t~nondet508 <= 2147483647;~nondetermined~6 := #t~nondet508;havoc #t~nondet508; {15094#true} is VALID [2022-02-20 21:49:02,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {15094#true} assume 0 != ~nondetermined~6;~ldv_mutex_mutex_of_uinput_device~0 := 2;#res := 0; {15094#true} is VALID [2022-02-20 21:49:02,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {15094#true} assume true; {15094#true} is VALID [2022-02-20 21:49:02,372 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {15094#true} {15095#false} #1652#return; {15095#false} is VALID [2022-02-20 21:49:02,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {15095#false} assume -2147483648 <= ldv_mutex_lock_interruptible_10_#t~ret495#1 && ldv_mutex_lock_interruptible_10_#t~ret495#1 <= 2147483647;ldv_mutex_lock_interruptible_10_~tmp___0~20#1 := ldv_mutex_lock_interruptible_10_#t~ret495#1;havoc ldv_mutex_lock_interruptible_10_#t~ret495#1;ldv_mutex_lock_interruptible_10_#res#1 := ldv_mutex_lock_interruptible_10_~tmp___0~20#1; {15095#false} is VALID [2022-02-20 21:49:02,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {15095#false} uinput_read_#t~ret276#1 := ldv_mutex_lock_interruptible_10_#res#1;assume { :end_inline_ldv_mutex_lock_interruptible_10 } true;assume -2147483648 <= uinput_read_#t~ret276#1 && uinput_read_#t~ret276#1 <= 2147483647;uinput_read_~tmp___0~11#1 := uinput_read_#t~ret276#1;havoc uinput_read_#t~ret276#1;uinput_read_~retval~4#1 := uinput_read_~tmp___0~11#1; {15095#false} is VALID [2022-02-20 21:49:02,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {15095#false} assume !(0 != uinput_read_~retval~4#1);call uinput_read_#t~mem277#1 := read~int(uinput_read_~udev~4#1.base, 164 + uinput_read_~udev~4#1.offset, 4); {15095#false} is VALID [2022-02-20 21:49:02,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {15095#false} assume 2 != uinput_read_#t~mem277#1 % 4294967296;havoc uinput_read_#t~mem277#1;uinput_read_~retval~4#1 := -19; {15095#false} is VALID [2022-02-20 21:49:02,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {15095#false} assume { :begin_inline_ldv_mutex_unlock_11 } true;ldv_mutex_unlock_11_#in~ldv_func_arg1#1.base, ldv_mutex_unlock_11_#in~ldv_func_arg1#1.offset := uinput_read_~udev~4#1.base, 8 + uinput_read_~udev~4#1.offset;havoc ldv_mutex_unlock_11_~ldv_func_arg1#1.base, ldv_mutex_unlock_11_~ldv_func_arg1#1.offset;ldv_mutex_unlock_11_~ldv_func_arg1#1.base, ldv_mutex_unlock_11_~ldv_func_arg1#1.offset := ldv_mutex_unlock_11_#in~ldv_func_arg1#1.base, ldv_mutex_unlock_11_#in~ldv_func_arg1#1.offset; {15095#false} is VALID [2022-02-20 21:49:02,375 INFO L272 TraceCheckUtils]: 39: Hoare triple {15095#false} call ldv_mutex_unlock_mutex_of_uinput_device(ldv_mutex_unlock_11_~ldv_func_arg1#1.base, ldv_mutex_unlock_11_~ldv_func_arg1#1.offset); {15095#false} is VALID [2022-02-20 21:49:02,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {15095#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {15095#false} is VALID [2022-02-20 21:49:02,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {15095#false} assume !(2 == ~ldv_mutex_mutex_of_uinput_device~0); {15095#false} is VALID [2022-02-20 21:49:02,376 INFO L272 TraceCheckUtils]: 42: Hoare triple {15095#false} call ldv_error(); {15095#false} is VALID [2022-02-20 21:49:02,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {15095#false} assume !false; {15095#false} is VALID [2022-02-20 21:49:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:49:02,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:49:02,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526205570] [2022-02-20 21:49:02,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526205570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:49:02,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:49:02,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:49:02,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626865549] [2022-02-20 21:49:02,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:49:02,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-02-20 21:49:02,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:49:02,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:49:02,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:02,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:49:02,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:49:02,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:49:02,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:49:02,416 INFO L87 Difference]: Start difference. First operand 1268 states and 1774 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:49:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:26,472 INFO L93 Difference]: Finished difference Result 2609 states and 3673 transitions. [2022-02-20 21:49:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:49:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-02-20 21:49:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:49:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:49:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2196 transitions. [2022-02-20 21:49:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:49:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2196 transitions. [2022-02-20 21:49:26,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 2196 transitions.