./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.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 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:26:41,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:26:41,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:26:41,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:26:41,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:26:41,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:26:41,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:26:41,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:26:41,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:26:41,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:26:41,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:26:41,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:26:41,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:26:41,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:26:41,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:26:41,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:26:41,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:26:41,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:26:41,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:26:41,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:26:41,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:26:41,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:26:41,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:26:41,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:26:41,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:26:41,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:26:41,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:26:41,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:26:41,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:26:41,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:26:41,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:26:41,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:26:41,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:26:41,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:26:41,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:26:41,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:26:41,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:26:41,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:26:41,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:26:41,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:26:41,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:26:41,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-16 05:26:41,268 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:26:41,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:26:41,270 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:26:41,270 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:26:41,271 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:26:41,271 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:26:41,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:26:41,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:26:41,273 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:26:41,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:26:41,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:26:41,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:26:41,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 05:26:41,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:26:41,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 05:26:41,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 05:26:41,275 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:26:41,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 05:26:41,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:26:41,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:26:41,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:26:41,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:26:41,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:26:41,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:26:41,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 05:26:41,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:26:41,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:26:41,284 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 05:26:41,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 05:26:41,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 05:26:41,284 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:26:41,285 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 -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2021-12-16 05:26:41,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:26:41,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:26:41,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:26:41,586 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:26:41,587 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:26:41,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-12-16 05:26:41,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2753b6bb/c8b8850a01b94973be2e06aea9521cf4/FLAG64e442151 [2021-12-16 05:26:42,370 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:26:42,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-12-16 05:26:42,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2753b6bb/c8b8850a01b94973be2e06aea9521cf4/FLAG64e442151 [2021-12-16 05:26:42,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2753b6bb/c8b8850a01b94973be2e06aea9521cf4 [2021-12-16 05:26:42,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:26:42,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:26:42,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:26:42,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:26:42,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:26:42,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:26:42" (1/1) ... [2021-12-16 05:26:42,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11337d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:42, skipping insertion in model container [2021-12-16 05:26:42,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:26:42" (1/1) ... [2021-12-16 05:26:42,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:26:42,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:26:45,076 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2021-12-16 05:26:45,079 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2021-12-16 05:26:45,080 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2021-12-16 05:26:45,081 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2021-12-16 05:26:45,081 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2021-12-16 05:26:45,082 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2021-12-16 05:26:45,083 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2021-12-16 05:26:45,083 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2021-12-16 05:26:45,083 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2021-12-16 05:26:45,084 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2021-12-16 05:26:45,094 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2021-12-16 05:26:45,102 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2021-12-16 05:26:45,103 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2021-12-16 05:26:45,104 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2021-12-16 05:26:45,105 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2021-12-16 05:26:45,105 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2021-12-16 05:26:45,106 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2021-12-16 05:26:45,112 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2021-12-16 05:26:45,114 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2021-12-16 05:26:45,115 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2021-12-16 05:26:45,115 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2021-12-16 05:26:45,116 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2021-12-16 05:26:45,116 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2021-12-16 05:26:45,117 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2021-12-16 05:26:45,119 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2021-12-16 05:26:45,119 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2021-12-16 05:26:45,120 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2021-12-16 05:26:45,120 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2021-12-16 05:26:45,121 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2021-12-16 05:26:45,122 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2021-12-16 05:26:45,123 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2021-12-16 05:26:45,124 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2021-12-16 05:26:45,124 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2021-12-16 05:26:45,124 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2021-12-16 05:26:45,125 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2021-12-16 05:26:45,125 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2021-12-16 05:26:45,126 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2021-12-16 05:26:45,126 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2021-12-16 05:26:45,126 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2021-12-16 05:26:45,127 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2021-12-16 05:26:45,127 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2021-12-16 05:26:45,128 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2021-12-16 05:26:45,128 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2021-12-16 05:26:45,128 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2021-12-16 05:26:45,129 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2021-12-16 05:26:45,129 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2021-12-16 05:26:45,129 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2021-12-16 05:26:45,130 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2021-12-16 05:26:45,130 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2021-12-16 05:26:45,130 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2021-12-16 05:26:45,131 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2021-12-16 05:26:45,131 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2021-12-16 05:26:45,131 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2021-12-16 05:26:45,132 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2021-12-16 05:26:45,132 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2021-12-16 05:26:45,132 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2021-12-16 05:26:45,133 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2021-12-16 05:26:45,133 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2021-12-16 05:26:45,133 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2021-12-16 05:26:45,134 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2021-12-16 05:26:45,134 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2021-12-16 05:26:45,135 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2021-12-16 05:26:45,135 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2021-12-16 05:26:45,135 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2021-12-16 05:26:45,136 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2021-12-16 05:26:45,136 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2021-12-16 05:26:45,136 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2021-12-16 05:26:45,137 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2021-12-16 05:26:45,137 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2021-12-16 05:26:45,137 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2021-12-16 05:26:45,138 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2021-12-16 05:26:45,138 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2021-12-16 05:26:45,138 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2021-12-16 05:26:45,139 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2021-12-16 05:26:45,139 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2021-12-16 05:26:45,139 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2021-12-16 05:26:45,140 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2021-12-16 05:26:45,140 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2021-12-16 05:26:45,140 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2021-12-16 05:26:45,141 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2021-12-16 05:26:45,141 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2021-12-16 05:26:45,141 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2021-12-16 05:26:45,142 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2021-12-16 05:26:45,142 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2021-12-16 05:26:45,143 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2021-12-16 05:26:45,143 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2021-12-16 05:26:45,143 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2021-12-16 05:26:45,144 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2021-12-16 05:26:45,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:26:45,174 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:26:45,418 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2021-12-16 05:26:45,418 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2021-12-16 05:26:45,419 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2021-12-16 05:26:45,419 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2021-12-16 05:26:45,419 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2021-12-16 05:26:45,420 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2021-12-16 05:26:45,420 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2021-12-16 05:26:45,420 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2021-12-16 05:26:45,421 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2021-12-16 05:26:45,421 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2021-12-16 05:26:45,421 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2021-12-16 05:26:45,422 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2021-12-16 05:26:45,422 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2021-12-16 05:26:45,422 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2021-12-16 05:26:45,423 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2021-12-16 05:26:45,423 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2021-12-16 05:26:45,423 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2021-12-16 05:26:45,424 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2021-12-16 05:26:45,424 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2021-12-16 05:26:45,424 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2021-12-16 05:26:45,425 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2021-12-16 05:26:45,425 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2021-12-16 05:26:45,425 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2021-12-16 05:26:45,426 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2021-12-16 05:26:45,426 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2021-12-16 05:26:45,426 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2021-12-16 05:26:45,427 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2021-12-16 05:26:45,427 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2021-12-16 05:26:45,427 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2021-12-16 05:26:45,428 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2021-12-16 05:26:45,428 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2021-12-16 05:26:45,428 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2021-12-16 05:26:45,429 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2021-12-16 05:26:45,429 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2021-12-16 05:26:45,429 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2021-12-16 05:26:45,430 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2021-12-16 05:26:45,430 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2021-12-16 05:26:45,430 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2021-12-16 05:26:45,431 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2021-12-16 05:26:45,431 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2021-12-16 05:26:45,431 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2021-12-16 05:26:45,432 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2021-12-16 05:26:45,432 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2021-12-16 05:26:45,433 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2021-12-16 05:26:45,433 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2021-12-16 05:26:45,433 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2021-12-16 05:26:45,434 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2021-12-16 05:26:45,435 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2021-12-16 05:26:45,436 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2021-12-16 05:26:45,436 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2021-12-16 05:26:45,437 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2021-12-16 05:26:45,437 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2021-12-16 05:26:45,437 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2021-12-16 05:26:45,438 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2021-12-16 05:26:45,438 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2021-12-16 05:26:45,438 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2021-12-16 05:26:45,439 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2021-12-16 05:26:45,439 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2021-12-16 05:26:45,439 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2021-12-16 05:26:45,440 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2021-12-16 05:26:45,440 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2021-12-16 05:26:45,440 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2021-12-16 05:26:45,440 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2021-12-16 05:26:45,441 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2021-12-16 05:26:45,441 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2021-12-16 05:26:45,441 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2021-12-16 05:26:45,441 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2021-12-16 05:26:45,442 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2021-12-16 05:26:45,442 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2021-12-16 05:26:45,442 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2021-12-16 05:26:45,443 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2021-12-16 05:26:45,443 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2021-12-16 05:26:45,443 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2021-12-16 05:26:45,443 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2021-12-16 05:26:45,444 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2021-12-16 05:26:45,444 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2021-12-16 05:26:45,444 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2021-12-16 05:26:45,444 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2021-12-16 05:26:45,445 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2021-12-16 05:26:45,445 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2021-12-16 05:26:45,445 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2021-12-16 05:26:45,445 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2021-12-16 05:26:45,446 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2021-12-16 05:26:45,446 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2021-12-16 05:26:45,446 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2021-12-16 05:26:45,447 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2021-12-16 05:26:45,447 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2021-12-16 05:26:45,447 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2021-12-16 05:26:45,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:26:45,572 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:26:45,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45 WrapperNode [2021-12-16 05:26:45,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:26:45,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:26:45,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:26:45,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:26:45,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,804 INFO L137 Inliner]: procedures = 526, calls = 1327, calls flagged for inlining = 223, calls inlined = 134, statements flattened = 2372 [2021-12-16 05:26:45,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:26:45,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:26:45,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:26:45,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:26:45,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:26:45,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:26:45,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:26:45,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:26:45,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (1/1) ... [2021-12-16 05:26:45,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:26:45,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:26:46,009 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) [2021-12-16 05:26:46,036 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 [2021-12-16 05:26:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-16 05:26:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-16 05:26:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-16 05:26:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-16 05:26:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-16 05:26:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-16 05:26:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2021-12-16 05:26:46,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2021-12-16 05:26:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-16 05:26:46,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-16 05:26:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-16 05:26:46,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-16 05:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-16 05:26:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-16 05:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2021-12-16 05:26:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2021-12-16 05:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-16 05:26:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-16 05:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-16 05:26:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-16 05:26:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-16 05:26:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-16 05:26:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:26:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-16 05:26:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-16 05:26:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-16 05:26:46,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-16 05:26:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-12-16 05:26:46,065 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-12-16 05:26:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-16 05:26:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-16 05:26:46,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-16 05:26:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-16 05:26:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-16 05:26:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2021-12-16 05:26:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2021-12-16 05:26:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-16 05:26:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-16 05:26:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 05:26:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-16 05:26:46,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-16 05:26:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-16 05:26:46,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-16 05:26:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-16 05:26:46,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-16 05:26:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-12-16 05:26:46,068 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-12-16 05:26:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-16 05:26:46,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-16 05:26:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2021-12-16 05:26:46,068 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2021-12-16 05:26:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-16 05:26:46,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-16 05:26:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2021-12-16 05:26:46,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2021-12-16 05:26:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2021-12-16 05:26:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2021-12-16 05:26:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-16 05:26:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-16 05:26:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:26:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:26:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-16 05:26:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-16 05:26:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:26:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-12-16 05:26:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-12-16 05:26:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-16 05:26:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-16 05:26:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2021-12-16 05:26:46,072 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2021-12-16 05:26:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-16 05:26:46,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-16 05:26:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-16 05:26:46,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-16 05:26:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-12-16 05:26:46,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-12-16 05:26:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2021-12-16 05:26:46,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2021-12-16 05:26:46,077 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2021-12-16 05:26:46,077 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2021-12-16 05:26:46,077 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2021-12-16 05:26:46,077 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2021-12-16 05:26:46,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:26:46,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:26:46,084 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2021-12-16 05:26:46,085 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2021-12-16 05:26:46,085 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2021-12-16 05:26:46,085 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2021-12-16 05:26:46,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-16 05:26:46,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-16 05:26:46,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-16 05:26:46,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-16 05:26:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2021-12-16 05:26:46,086 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2021-12-16 05:26:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-16 05:26:46,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-16 05:26:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-16 05:26:46,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-16 05:26:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2021-12-16 05:26:46,087 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2021-12-16 05:26:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-16 05:26:46,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-16 05:26:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2021-12-16 05:26:46,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2021-12-16 05:26:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 05:26:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-16 05:26:46,088 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-16 05:26:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-16 05:26:46,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-16 05:26:46,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:26:46,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 05:26:46,089 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-12-16 05:26:46,089 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-12-16 05:26:46,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-16 05:26:46,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-16 05:26:46,090 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-16 05:26:46,090 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-16 05:26:46,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-16 05:26:46,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-16 05:26:46,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2021-12-16 05:26:46,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2021-12-16 05:26:46,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-16 05:26:46,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-16 05:26:46,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-16 05:26:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-16 05:26:46,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-16 05:26:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-16 05:26:46,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-16 05:26:46,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-16 05:26:46,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-16 05:26:46,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-16 05:26:46,093 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-16 05:26:46,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-16 05:26:46,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-16 05:26:46,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-16 05:26:46,093 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2021-12-16 05:26:46,093 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2021-12-16 05:26:46,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2021-12-16 05:26:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2021-12-16 05:26:46,094 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-16 05:26:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-16 05:26:46,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-16 05:26:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-16 05:26:46,094 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2021-12-16 05:26:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2021-12-16 05:26:46,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:26:46,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-16 05:26:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-16 05:26:46,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-16 05:26:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-16 05:26:46,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-16 05:26:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-16 05:26:46,096 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-12-16 05:26:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-12-16 05:26:46,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-16 05:26:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-16 05:26:46,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-16 05:26:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-16 05:26:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2021-12-16 05:26:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2021-12-16 05:26:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:26:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2021-12-16 05:26:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2021-12-16 05:26:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2021-12-16 05:26:46,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2021-12-16 05:26:46,607 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:26:46,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:26:46,886 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-16 05:26:49,100 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:26:49,124 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:26:49,124 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 05:26:49,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:26:49 BoogieIcfgContainer [2021-12-16 05:26:49,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:26:49,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:26:49,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:26:49,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:26:49,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:26:42" (1/3) ... [2021-12-16 05:26:49,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4b35e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:26:49, skipping insertion in model container [2021-12-16 05:26:49,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:45" (2/3) ... [2021-12-16 05:26:49,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4b35e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:26:49, skipping insertion in model container [2021-12-16 05:26:49,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:26:49" (3/3) ... [2021-12-16 05:26:49,138 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-12-16 05:26:49,143 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:26:49,143 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-12-16 05:26:49,197 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:26:49,202 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 [2021-12-16 05:26:49,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-12-16 05:26:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 988 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 687 states have internal predecessors, (823), 240 states have call successors, (240), 76 states have call predecessors, (240), 75 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) [2021-12-16 05:26:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-16 05:26:49,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:26:49,261 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:26:49,261 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:26:49,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:26:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash 248613159, now seen corresponding path program 1 times [2021-12-16 05:26:49,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:26:49,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353976678] [2021-12-16 05:26:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:26:49,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:26:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:26:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:26:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:26:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:26:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:26:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:26:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:26:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:26:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:26:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:26:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:26:50,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:26:50,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353976678] [2021-12-16 05:26:50,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353976678] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:26:50,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:26:50,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:26:50,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993115113] [2021-12-16 05:26:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:26:50,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:26:50,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:26:50,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:26:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:26:50,043 INFO L87 Difference]: Start difference. First operand has 988 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 687 states have internal predecessors, (823), 240 states have call successors, (240), 76 states have call predecessors, (240), 75 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-16 05:26:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:26:52,372 INFO L93 Difference]: Finished difference Result 1927 states and 2626 transitions. [2021-12-16 05:26:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:26:52,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2021-12-16 05:26:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:26:52,391 INFO L225 Difference]: With dead ends: 1927 [2021-12-16 05:26:52,391 INFO L226 Difference]: Without dead ends: 970 [2021-12-16 05:26:52,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:26:52,409 INFO L933 BasicCegarLoop]: 1213 mSDtfsCounter, 1656 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:26:52,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1834 Valid, 2953 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-16 05:26:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-12-16 05:26:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2021-12-16 05:26:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 632 states have (on average 1.2294303797468353) internal successors, (777), 672 states have internal predecessors, (777), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:26:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1245 transitions. [2021-12-16 05:26:52,519 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1245 transitions. Word has length 71 [2021-12-16 05:26:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:26:52,521 INFO L470 AbstractCegarLoop]: Abstraction has 970 states and 1245 transitions. [2021-12-16 05:26:52,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-16 05:26:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1245 transitions. [2021-12-16 05:26:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-16 05:26:52,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:26:52,524 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:26:52,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:26:52,525 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:26:52,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:26:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 544752548, now seen corresponding path program 1 times [2021-12-16 05:26:52,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:26:52,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289026600] [2021-12-16 05:26:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:26:52,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:26:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:26:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:26:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:26:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:26:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:26:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:26:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:26:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:26:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:26:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:26:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:26:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:26:52,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:26:52,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289026600] [2021-12-16 05:26:52,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289026600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:26:52,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:26:52,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:26:52,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231836745] [2021-12-16 05:26:52,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:26:52,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:26:52,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:26:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:26:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:26:52,846 INFO L87 Difference]: Start difference. First operand 970 states and 1245 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-16 05:26:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:26:54,802 INFO L93 Difference]: Finished difference Result 970 states and 1245 transitions. [2021-12-16 05:26:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:26:54,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2021-12-16 05:26:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:26:54,815 INFO L225 Difference]: With dead ends: 970 [2021-12-16 05:26:54,815 INFO L226 Difference]: Without dead ends: 968 [2021-12-16 05:26:54,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:26:54,819 INFO L933 BasicCegarLoop]: 1193 mSDtfsCounter, 1622 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-16 05:26:54,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1797 Valid, 2911 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-16 05:26:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2021-12-16 05:26:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2021-12-16 05:26:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 631 states have (on average 1.2282091917591125) internal successors, (775), 670 states have internal predecessors, (775), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:26:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1243 transitions. [2021-12-16 05:26:54,892 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1243 transitions. Word has length 77 [2021-12-16 05:26:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:26:54,893 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1243 transitions. [2021-12-16 05:26:54,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-16 05:26:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1243 transitions. [2021-12-16 05:26:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 05:26:54,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:26:54,895 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:26:54,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:26:54,896 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:26:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:26:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1429765362, now seen corresponding path program 1 times [2021-12-16 05:26:54,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:26:54,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701269451] [2021-12-16 05:26:54,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:26:54,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:26:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:26:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:26:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:26:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:26:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:26:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:26:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:26:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:26:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:26:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:26:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:26:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:26:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:26:55,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:26:55,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701269451] [2021-12-16 05:26:55,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701269451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:26:55,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:26:55,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:26:55,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62013978] [2021-12-16 05:26:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:26:55,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:26:55,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:26:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:26:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:26:55,168 INFO L87 Difference]: Start difference. First operand 968 states and 1243 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 05:26:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:26:56,996 INFO L93 Difference]: Finished difference Result 968 states and 1243 transitions. [2021-12-16 05:26:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:26:56,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2021-12-16 05:26:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:26:57,002 INFO L225 Difference]: With dead ends: 968 [2021-12-16 05:26:57,002 INFO L226 Difference]: Without dead ends: 966 [2021-12-16 05:26:57,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:26:57,004 INFO L933 BasicCegarLoop]: 1191 mSDtfsCounter, 1616 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:26:57,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1790 Valid, 2909 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-16 05:26:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-12-16 05:26:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2021-12-16 05:26:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 630 states have (on average 1.226984126984127) internal successors, (773), 668 states have internal predecessors, (773), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:26:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1241 transitions. [2021-12-16 05:26:57,053 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1241 transitions. Word has length 83 [2021-12-16 05:26:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:26:57,055 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1241 transitions. [2021-12-16 05:26:57,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 05:26:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1241 transitions. [2021-12-16 05:26:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-16 05:26:57,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:26:57,065 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:26:57,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:26:57,065 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:26:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:26:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash -454572405, now seen corresponding path program 1 times [2021-12-16 05:26:57,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:26:57,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114769451] [2021-12-16 05:26:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:26:57,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:26:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:26:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:26:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:26:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:26:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:26:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:26:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:26:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:26:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:26:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:26:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:26:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:26:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:26:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:26:57,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:26:57,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114769451] [2021-12-16 05:26:57,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114769451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:26:57,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:26:57,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:26:57,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342004856] [2021-12-16 05:26:57,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:26:57,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:26:57,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:26:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:26:57,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:26:57,358 INFO L87 Difference]: Start difference. First operand 966 states and 1241 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-16 05:26:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:26:59,227 INFO L93 Difference]: Finished difference Result 966 states and 1241 transitions. [2021-12-16 05:26:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:26:59,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2021-12-16 05:26:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:26:59,234 INFO L225 Difference]: With dead ends: 966 [2021-12-16 05:26:59,234 INFO L226 Difference]: Without dead ends: 964 [2021-12-16 05:26:59,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:26:59,236 INFO L933 BasicCegarLoop]: 1189 mSDtfsCounter, 1610 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:26:59,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1783 Valid, 2907 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-16 05:26:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2021-12-16 05:26:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2021-12-16 05:26:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 629 states have (on average 1.2257551669316376) internal successors, (771), 666 states have internal predecessors, (771), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:26:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1239 transitions. [2021-12-16 05:26:59,280 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1239 transitions. Word has length 89 [2021-12-16 05:26:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:26:59,282 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1239 transitions. [2021-12-16 05:26:59,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-16 05:26:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1239 transitions. [2021-12-16 05:26:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-16 05:26:59,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:26:59,287 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:26:59,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:26:59,287 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:26:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:26:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1517419958, now seen corresponding path program 1 times [2021-12-16 05:26:59,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:26:59,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70392920] [2021-12-16 05:26:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:26:59,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:26:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:26:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:26:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:26:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:26:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:26:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:26:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:26:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:26:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:26:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:26:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:26:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:26:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:26:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:26:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:26:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:26:59,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:26:59,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70392920] [2021-12-16 05:26:59,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70392920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:26:59,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:26:59,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:26:59,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010283329] [2021-12-16 05:26:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:26:59,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:26:59,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:26:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:26:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:26:59,530 INFO L87 Difference]: Start difference. First operand 964 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-16 05:27:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:01,440 INFO L93 Difference]: Finished difference Result 964 states and 1239 transitions. [2021-12-16 05:27:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2021-12-16 05:27:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:01,446 INFO L225 Difference]: With dead ends: 964 [2021-12-16 05:27:01,447 INFO L226 Difference]: Without dead ends: 962 [2021-12-16 05:27:01,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:01,448 INFO L933 BasicCegarLoop]: 1187 mSDtfsCounter, 1604 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:01,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1776 Valid, 2905 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-16 05:27:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-12-16 05:27:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2021-12-16 05:27:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 628 states have (on average 1.2245222929936306) internal successors, (769), 664 states have internal predecessors, (769), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1237 transitions. [2021-12-16 05:27:01,487 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1237 transitions. Word has length 95 [2021-12-16 05:27:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:01,489 INFO L470 AbstractCegarLoop]: Abstraction has 962 states and 1237 transitions. [2021-12-16 05:27:01,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-16 05:27:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1237 transitions. [2021-12-16 05:27:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-16 05:27:01,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:01,492 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:01,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:27:01,493 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 179646454, now seen corresponding path program 1 times [2021-12-16 05:27:01,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:01,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028332977] [2021-12-16 05:27:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:01,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:01,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:01,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028332977] [2021-12-16 05:27:01,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028332977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:01,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:01,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:01,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030635530] [2021-12-16 05:27:01,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:01,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:01,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:01,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:01,722 INFO L87 Difference]: Start difference. First operand 962 states and 1237 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-16 05:27:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:03,616 INFO L93 Difference]: Finished difference Result 962 states and 1237 transitions. [2021-12-16 05:27:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:03,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2021-12-16 05:27:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:03,622 INFO L225 Difference]: With dead ends: 962 [2021-12-16 05:27:03,622 INFO L226 Difference]: Without dead ends: 960 [2021-12-16 05:27:03,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:03,623 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 1598 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:03,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1769 Valid, 2903 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-16 05:27:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-12-16 05:27:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2021-12-16 05:27:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 627 states have (on average 1.223285486443381) internal successors, (767), 662 states have internal predecessors, (767), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1235 transitions. [2021-12-16 05:27:03,666 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1235 transitions. Word has length 101 [2021-12-16 05:27:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:03,667 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1235 transitions. [2021-12-16 05:27:03,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-16 05:27:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1235 transitions. [2021-12-16 05:27:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-16 05:27:03,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:03,668 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:03,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:27:03,669 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:03,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash -862139684, now seen corresponding path program 1 times [2021-12-16 05:27:03,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:03,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163298956] [2021-12-16 05:27:03,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:03,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 05:27:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:03,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163298956] [2021-12-16 05:27:03,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163298956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:03,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:03,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:03,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939061628] [2021-12-16 05:27:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:03,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:03,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:03,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:03,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:03,892 INFO L87 Difference]: Start difference. First operand 960 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-16 05:27:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:05,588 INFO L93 Difference]: Finished difference Result 960 states and 1235 transitions. [2021-12-16 05:27:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:05,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2021-12-16 05:27:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:05,592 INFO L225 Difference]: With dead ends: 960 [2021-12-16 05:27:05,593 INFO L226 Difference]: Without dead ends: 958 [2021-12-16 05:27:05,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:05,593 INFO L933 BasicCegarLoop]: 1183 mSDtfsCounter, 1592 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:05,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1762 Valid, 2901 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 05:27:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-12-16 05:27:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2021-12-16 05:27:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 626 states have (on average 1.2220447284345048) internal successors, (765), 660 states have internal predecessors, (765), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1233 transitions. [2021-12-16 05:27:05,632 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1233 transitions. Word has length 107 [2021-12-16 05:27:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:05,633 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 1233 transitions. [2021-12-16 05:27:05,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-16 05:27:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1233 transitions. [2021-12-16 05:27:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-16 05:27:05,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:05,637 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:05,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:27:05,637 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash 215029627, now seen corresponding path program 1 times [2021-12-16 05:27:05,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:05,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703870229] [2021-12-16 05:27:05,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:05,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 05:27:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:05,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:05,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703870229] [2021-12-16 05:27:05,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703870229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:05,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:05,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:05,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687629489] [2021-12-16 05:27:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:05,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:05,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:05,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:05,861 INFO L87 Difference]: Start difference. First operand 958 states and 1233 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-16 05:27:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:07,566 INFO L93 Difference]: Finished difference Result 958 states and 1233 transitions. [2021-12-16 05:27:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:07,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2021-12-16 05:27:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:07,572 INFO L225 Difference]: With dead ends: 958 [2021-12-16 05:27:07,572 INFO L226 Difference]: Without dead ends: 956 [2021-12-16 05:27:07,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:07,573 INFO L933 BasicCegarLoop]: 1181 mSDtfsCounter, 1590 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:07,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1759 Valid, 2899 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 05:27:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-12-16 05:27:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2021-12-16 05:27:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 625 states have (on average 1.2208) internal successors, (763), 658 states have internal predecessors, (763), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1231 transitions. [2021-12-16 05:27:07,617 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1231 transitions. Word has length 113 [2021-12-16 05:27:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:07,618 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1231 transitions. [2021-12-16 05:27:07,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-16 05:27:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1231 transitions. [2021-12-16 05:27:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-16 05:27:07,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:07,620 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:07,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 05:27:07,621 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 485176158, now seen corresponding path program 1 times [2021-12-16 05:27:07,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:07,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731010736] [2021-12-16 05:27:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:07,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 05:27:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:07,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:07,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731010736] [2021-12-16 05:27:07,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731010736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:07,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:07,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:07,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949259474] [2021-12-16 05:27:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:07,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:07,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:07,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:07,828 INFO L87 Difference]: Start difference. First operand 956 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-16 05:27:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:09,421 INFO L93 Difference]: Finished difference Result 956 states and 1231 transitions. [2021-12-16 05:27:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:09,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2021-12-16 05:27:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:09,428 INFO L225 Difference]: With dead ends: 956 [2021-12-16 05:27:09,428 INFO L226 Difference]: Without dead ends: 954 [2021-12-16 05:27:09,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:09,431 INFO L933 BasicCegarLoop]: 1179 mSDtfsCounter, 1578 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:09,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1747 Valid, 2897 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-16 05:27:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-12-16 05:27:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2021-12-16 05:27:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 624 states have (on average 1.2195512820512822) internal successors, (761), 656 states have internal predecessors, (761), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1229 transitions. [2021-12-16 05:27:09,480 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1229 transitions. Word has length 115 [2021-12-16 05:27:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:09,481 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1229 transitions. [2021-12-16 05:27:09,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-16 05:27:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1229 transitions. [2021-12-16 05:27:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-16 05:27:09,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:09,483 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:09,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 05:27:09,483 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash 907436211, now seen corresponding path program 1 times [2021-12-16 05:27:09,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:09,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491517113] [2021-12-16 05:27:09,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:09,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 05:27:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-16 05:27:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:09,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491517113] [2021-12-16 05:27:09,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491517113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:09,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:09,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:09,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928892536] [2021-12-16 05:27:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:09,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:09,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:09,682 INFO L87 Difference]: Start difference. First operand 954 states and 1229 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:27:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:11,573 INFO L93 Difference]: Finished difference Result 954 states and 1229 transitions. [2021-12-16 05:27:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:11,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2021-12-16 05:27:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:11,577 INFO L225 Difference]: With dead ends: 954 [2021-12-16 05:27:11,577 INFO L226 Difference]: Without dead ends: 952 [2021-12-16 05:27:11,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:11,579 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 1574 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:11,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1742 Valid, 2895 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-16 05:27:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2021-12-16 05:27:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2021-12-16 05:27:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 623 states have (on average 1.218298555377207) internal successors, (759), 654 states have internal predecessors, (759), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1227 transitions. [2021-12-16 05:27:11,647 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1227 transitions. Word has length 121 [2021-12-16 05:27:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:11,648 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1227 transitions. [2021-12-16 05:27:11,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:27:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1227 transitions. [2021-12-16 05:27:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-16 05:27:11,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:11,650 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:11,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:27:11,651 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash -289800848, now seen corresponding path program 1 times [2021-12-16 05:27:11,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:11,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923892228] [2021-12-16 05:27:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:11,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 05:27:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-16 05:27:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 05:27:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-16 05:27:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-16 05:27:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-16 05:27:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-16 05:27:12,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:12,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923892228] [2021-12-16 05:27:12,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923892228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:12,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:12,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:27:12,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845091425] [2021-12-16 05:27:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:12,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:27:12,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:27:12,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:27:12,014 INFO L87 Difference]: Start difference. First operand 952 states and 1227 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-16 05:27:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:14,943 INFO L93 Difference]: Finished difference Result 1878 states and 2427 transitions. [2021-12-16 05:27:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:27:14,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2021-12-16 05:27:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:14,950 INFO L225 Difference]: With dead ends: 1878 [2021-12-16 05:27:14,950 INFO L226 Difference]: Without dead ends: 965 [2021-12-16 05:27:14,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-12-16 05:27:14,955 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 1892 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 4628 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:14,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2073 Valid, 4628 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-16 05:27:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-12-16 05:27:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 952. [2021-12-16 05:27:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 623 states have (on average 1.21669341894061) internal successors, (758), 654 states have internal predecessors, (758), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1226 transitions. [2021-12-16 05:27:15,042 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1226 transitions. Word has length 164 [2021-12-16 05:27:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:15,043 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1226 transitions. [2021-12-16 05:27:15,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-16 05:27:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1226 transitions. [2021-12-16 05:27:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-16 05:27:15,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:15,045 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:15,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 05:27:15,045 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash -289741266, now seen corresponding path program 1 times [2021-12-16 05:27:15,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:15,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876782194] [2021-12-16 05:27:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:15,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 05:27:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-16 05:27:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 05:27:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-16 05:27:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-16 05:27:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-16 05:27:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-16 05:27:15,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:15,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876782194] [2021-12-16 05:27:15,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876782194] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:15,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:15,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:27:15,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276742853] [2021-12-16 05:27:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:15,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:27:15,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:15,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:27:15,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:27:15,317 INFO L87 Difference]: Start difference. First operand 952 states and 1226 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-16 05:27:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:17,841 INFO L93 Difference]: Finished difference Result 965 states and 1247 transitions. [2021-12-16 05:27:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:27:17,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 164 [2021-12-16 05:27:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:17,849 INFO L225 Difference]: With dead ends: 965 [2021-12-16 05:27:17,850 INFO L226 Difference]: Without dead ends: 963 [2021-12-16 05:27:17,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-16 05:27:17,852 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 967 mSDsluCounter, 3024 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 848 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 4195 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 848 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:17,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [967 Valid, 4195 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [848 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-16 05:27:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-12-16 05:27:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 950. [2021-12-16 05:27:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 622 states have (on average 1.2154340836012862) internal successors, (756), 652 states have internal predecessors, (756), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1224 transitions. [2021-12-16 05:27:17,898 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1224 transitions. Word has length 164 [2021-12-16 05:27:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:17,898 INFO L470 AbstractCegarLoop]: Abstraction has 950 states and 1224 transitions. [2021-12-16 05:27:17,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-16 05:27:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1224 transitions. [2021-12-16 05:27:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-16 05:27:17,900 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:17,900 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:17,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:27:17,901 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1029929949, now seen corresponding path program 1 times [2021-12-16 05:27:17,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:17,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594687043] [2021-12-16 05:27:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:17,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 05:27:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-16 05:27:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 05:27:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:18,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:18,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594687043] [2021-12-16 05:27:18,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594687043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:18,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:18,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:18,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38354445] [2021-12-16 05:27:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:18,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:18,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:18,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:18,148 INFO L87 Difference]: Start difference. First operand 950 states and 1224 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-16 05:27:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:19,853 INFO L93 Difference]: Finished difference Result 950 states and 1224 transitions. [2021-12-16 05:27:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:19,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2021-12-16 05:27:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:19,857 INFO L225 Difference]: With dead ends: 950 [2021-12-16 05:27:19,857 INFO L226 Difference]: Without dead ends: 948 [2021-12-16 05:27:19,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:19,858 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 1559 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:19,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1726 Valid, 2890 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 05:27:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2021-12-16 05:27:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2021-12-16 05:27:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 621 states have (on average 1.214170692431562) internal successors, (754), 650 states have internal predecessors, (754), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1222 transitions. [2021-12-16 05:27:19,904 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1222 transitions. Word has length 127 [2021-12-16 05:27:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:19,905 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1222 transitions. [2021-12-16 05:27:19,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-16 05:27:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1222 transitions. [2021-12-16 05:27:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-16 05:27:19,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:19,907 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:19,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 05:27:19,908 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2095809396, now seen corresponding path program 1 times [2021-12-16 05:27:19,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:19,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877380397] [2021-12-16 05:27:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:19,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 05:27:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-16 05:27:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 05:27:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-16 05:27:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-16 05:27:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-16 05:27:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-16 05:27:20,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:20,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877380397] [2021-12-16 05:27:20,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877380397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:20,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:20,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:20,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622274765] [2021-12-16 05:27:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:20,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:20,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:20,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:20,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:20,244 INFO L87 Difference]: Start difference. First operand 948 states and 1222 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-16 05:27:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:22,118 INFO L93 Difference]: Finished difference Result 1866 states and 2413 transitions. [2021-12-16 05:27:22,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:22,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2021-12-16 05:27:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:22,123 INFO L225 Difference]: With dead ends: 1866 [2021-12-16 05:27:22,124 INFO L226 Difference]: Without dead ends: 957 [2021-12-16 05:27:22,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:22,128 INFO L933 BasicCegarLoop]: 1165 mSDtfsCounter, 1853 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:22,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2034 Valid, 2481 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-16 05:27:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-12-16 05:27:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 944. [2021-12-16 05:27:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 618 states have (on average 1.2119741100323624) internal successors, (749), 646 states have internal predecessors, (749), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1217 transitions. [2021-12-16 05:27:22,176 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1217 transitions. Word has length 171 [2021-12-16 05:27:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:22,177 INFO L470 AbstractCegarLoop]: Abstraction has 944 states and 1217 transitions. [2021-12-16 05:27:22,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-16 05:27:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1217 transitions. [2021-12-16 05:27:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-16 05:27:22,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:22,179 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:22,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 05:27:22,180 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash 664932848, now seen corresponding path program 1 times [2021-12-16 05:27:22,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:22,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655016517] [2021-12-16 05:27:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:22,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 05:27:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-16 05:27:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 05:27:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-16 05:27:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:22,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:22,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655016517] [2021-12-16 05:27:22,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655016517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:22,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:22,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:22,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351862458] [2021-12-16 05:27:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:22,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:22,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:22,431 INFO L87 Difference]: Start difference. First operand 944 states and 1217 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-16 05:27:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:24,028 INFO L93 Difference]: Finished difference Result 944 states and 1217 transitions. [2021-12-16 05:27:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:24,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2021-12-16 05:27:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:24,032 INFO L225 Difference]: With dead ends: 944 [2021-12-16 05:27:24,032 INFO L226 Difference]: Without dead ends: 942 [2021-12-16 05:27:24,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:24,033 INFO L933 BasicCegarLoop]: 1165 mSDtfsCounter, 1538 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:24,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1704 Valid, 2883 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-16 05:27:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2021-12-16 05:27:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2021-12-16 05:27:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 617 states have (on average 1.2106969205834683) internal successors, (747), 644 states have internal predecessors, (747), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2021-12-16 05:27:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1215 transitions. [2021-12-16 05:27:24,081 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1215 transitions. Word has length 133 [2021-12-16 05:27:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:24,081 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1215 transitions. [2021-12-16 05:27:24,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-16 05:27:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1215 transitions. [2021-12-16 05:27:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-12-16 05:27:24,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:24,084 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:24,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:27:24,084 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash -793485747, now seen corresponding path program 1 times [2021-12-16 05:27:24,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:24,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767890497] [2021-12-16 05:27:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:24,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-16 05:27:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-16 05:27:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-16 05:27:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 05:27:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-16 05:27:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-12-16 05:27:24,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:24,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767890497] [2021-12-16 05:27:24,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767890497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:24,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:24,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:27:24,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092690806] [2021-12-16 05:27:24,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:24,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:27:24,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:27:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:27:24,374 INFO L87 Difference]: Start difference. First operand 942 states and 1215 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2021-12-16 05:27:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:27,631 INFO L93 Difference]: Finished difference Result 1900 states and 2489 transitions. [2021-12-16 05:27:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:27:27,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2021-12-16 05:27:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:27,638 INFO L225 Difference]: With dead ends: 1900 [2021-12-16 05:27:27,638 INFO L226 Difference]: Without dead ends: 1232 [2021-12-16 05:27:27,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:27:27,640 INFO L933 BasicCegarLoop]: 1290 mSDtfsCounter, 1418 mSDsluCounter, 5075 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 1233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 6365 SdHoareTripleChecker+Invalid, 3608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1233 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:27,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1418 Valid, 6365 Invalid, 3608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1233 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-16 05:27:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2021-12-16 05:27:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 947. [2021-12-16 05:27:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 621 states have (on average 1.209339774557166) internal successors, (751), 648 states have internal predecessors, (751), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2021-12-16 05:27:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1222 transitions. [2021-12-16 05:27:27,699 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1222 transitions. Word has length 167 [2021-12-16 05:27:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:27,699 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1222 transitions. [2021-12-16 05:27:27,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2021-12-16 05:27:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1222 transitions. [2021-12-16 05:27:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-12-16 05:27:27,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:27,702 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:27,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:27:27,702 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1553023, now seen corresponding path program 1 times [2021-12-16 05:27:27,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:27,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427256293] [2021-12-16 05:27:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:27,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 05:27:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-16 05:27:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 05:27:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-16 05:27:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-16 05:27:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:27,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:27,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427256293] [2021-12-16 05:27:27,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427256293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:27,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:27,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:27,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097518999] [2021-12-16 05:27:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:27,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:27,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:27,916 INFO L87 Difference]: Start difference. First operand 947 states and 1222 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-16 05:27:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:29,583 INFO L93 Difference]: Finished difference Result 947 states and 1222 transitions. [2021-12-16 05:27:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2021-12-16 05:27:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:29,589 INFO L225 Difference]: With dead ends: 947 [2021-12-16 05:27:29,589 INFO L226 Difference]: Without dead ends: 945 [2021-12-16 05:27:29,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:29,590 INFO L933 BasicCegarLoop]: 1163 mSDtfsCounter, 1532 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:29,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1697 Valid, 2881 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 05:27:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-12-16 05:27:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2021-12-16 05:27:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 620 states have (on average 1.2080645161290322) internal successors, (749), 646 states have internal predecessors, (749), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2021-12-16 05:27:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1220 transitions. [2021-12-16 05:27:29,647 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1220 transitions. Word has length 139 [2021-12-16 05:27:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:29,647 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 1220 transitions. [2021-12-16 05:27:29,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-16 05:27:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1220 transitions. [2021-12-16 05:27:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-16 05:27:29,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:29,650 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:29,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 05:27:29,650 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 155827134, now seen corresponding path program 1 times [2021-12-16 05:27:29,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:29,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72335822] [2021-12-16 05:27:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:29,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 05:27:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 05:27:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 05:27:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 05:27:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-16 05:27:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 05:27:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-16 05:27:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 05:27:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-16 05:27:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-16 05:27:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-16 05:27:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 05:27:29,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:29,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72335822] [2021-12-16 05:27:29,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72335822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:29,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:29,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:29,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214584551] [2021-12-16 05:27:29,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:29,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:29,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:29,869 INFO L87 Difference]: Start difference. First operand 945 states and 1220 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-16 05:27:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:31,461 INFO L93 Difference]: Finished difference Result 945 states and 1220 transitions. [2021-12-16 05:27:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:31,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2021-12-16 05:27:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:31,466 INFO L225 Difference]: With dead ends: 945 [2021-12-16 05:27:31,466 INFO L226 Difference]: Without dead ends: 943 [2021-12-16 05:27:31,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:31,467 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 1526 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:31,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1690 Valid, 2879 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-16 05:27:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-12-16 05:27:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2021-12-16 05:27:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 619 states have (on average 1.2067851373182552) internal successors, (747), 644 states have internal predecessors, (747), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2021-12-16 05:27:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1218 transitions. [2021-12-16 05:27:31,522 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1218 transitions. Word has length 145 [2021-12-16 05:27:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:31,523 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 1218 transitions. [2021-12-16 05:27:31,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-16 05:27:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1218 transitions. [2021-12-16 05:27:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-12-16 05:27:31,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:31,526 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:31,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 05:27:31,526 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2021-12-16 05:27:31,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:31,527 INFO L85 PathProgramCache]: Analyzing trace with hash -190426035, now seen corresponding path program 1 times [2021-12-16 05:27:31,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:31,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774411364] [2021-12-16 05:27:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:31,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 05:27:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 05:27:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 05:27:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 05:27:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 05:27:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 05:27:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-16 05:27:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-16 05:27:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-16 05:27:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 05:27:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-16 05:27:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 05:27:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 05:27:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2021-12-16 05:27:31,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:31,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774411364] [2021-12-16 05:27:31,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774411364] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:31,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:31,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:27:31,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807097803] [2021-12-16 05:27:31,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:31,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:27:31,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:31,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:27:31,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:27:31,840 INFO L87 Difference]: Start difference. First operand 943 states and 1218 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24)