./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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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--media--usb--ttusb-budget--dvb-ttusb-budget.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 4426d364359557dc10cf7e8f346d379b7d379eaf4a1a095af818bcdb9a3f651d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 12:40:37,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 12:40:37,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 12:40:37,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 12:40:37,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 12:40:37,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 12:40:37,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 12:40:37,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 12:40:37,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 12:40:37,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 12:40:37,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 12:40:37,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 12:40:37,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 12:40:37,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 12:40:37,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 12:40:37,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 12:40:37,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 12:40:37,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 12:40:37,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 12:40:37,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 12:40:37,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 12:40:37,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 12:40:37,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 12:40:37,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 12:40:37,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 12:40:37,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 12:40:37,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 12:40:37,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 12:40:37,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 12:40:37,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 12:40:37,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 12:40:37,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 12:40:37,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 12:40:37,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 12:40:37,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 12:40:37,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 12:40:37,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 12:40:37,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 12:40:37,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 12:40:37,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 12:40:37,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 12:40:37,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 12:40:37,250 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 12:40:37,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 12:40:37,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 12:40:37,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 12:40:37,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 12:40:37,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 12:40:37,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 12:40:37,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 12:40:37,255 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 12:40:37,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 12:40:37,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 12:40:37,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 12:40:37,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 12:40:37,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 12:40:37,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 12:40:37,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 12:40:37,257 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 12:40:37,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 12:40:37,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 12:40:37,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 12:40:37,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 12:40:37,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:40:37,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 12:40:37,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 12:40:37,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 12:40:37,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 12:40:37,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 12:40:37,259 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 12:40:37,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 12:40:37,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 12:40:37,260 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 12:40:37,260 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 -> 4426d364359557dc10cf7e8f346d379b7d379eaf4a1a095af818bcdb9a3f651d [2021-11-17 12:40:37,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 12:40:37,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 12:40:37,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 12:40:37,509 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 12:40:37,509 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 12:40:37,510 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i [2021-11-17 12:40:37,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e62950d6/00f474170303443497a08c2909a2b185/FLAGd9bf4510e [2021-11-17 12:40:38,222 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 12:40:38,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i [2021-11-17 12:40:38,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e62950d6/00f474170303443497a08c2909a2b185/FLAGd9bf4510e [2021-11-17 12:40:38,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e62950d6/00f474170303443497a08c2909a2b185 [2021-11-17 12:40:38,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 12:40:38,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 12:40:38,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 12:40:38,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 12:40:38,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 12:40:38,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:40:38" (1/1) ... [2021-11-17 12:40:38,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f74d56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:38, skipping insertion in model container [2021-11-17 12:40:38,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:40:38" (1/1) ... [2021-11-17 12:40:38,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 12:40:38,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 12:40:41,032 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405731,405744] [2021-11-17 12:40:41,035 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405876,405889] [2021-11-17 12:40:41,035 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406022,406035] [2021-11-17 12:40:41,036 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406187,406200] [2021-11-17 12:40:41,036 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406345,406358] [2021-11-17 12:40:41,037 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406503,406516] [2021-11-17 12:40:41,037 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406661,406674] [2021-11-17 12:40:41,037 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406821,406834] [2021-11-17 12:40:41,038 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406980,406993] [2021-11-17 12:40:41,038 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407119,407132] [2021-11-17 12:40:41,038 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407261,407274] [2021-11-17 12:40:41,038 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407410,407423] [2021-11-17 12:40:41,039 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407549,407562] [2021-11-17 12:40:41,039 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407704,407717] [2021-11-17 12:40:41,039 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407864,407877] [2021-11-17 12:40:41,040 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408015,408028] [2021-11-17 12:40:41,040 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408166,408179] [2021-11-17 12:40:41,040 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408318,408331] [2021-11-17 12:40:41,041 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408467,408480] [2021-11-17 12:40:41,041 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408615,408628] [2021-11-17 12:40:41,041 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408772,408785] [2021-11-17 12:40:41,042 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408921,408934] [2021-11-17 12:40:41,042 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409077,409090] [2021-11-17 12:40:41,042 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409230,409243] [2021-11-17 12:40:41,043 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409376,409389] [2021-11-17 12:40:41,043 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409519,409532] [2021-11-17 12:40:41,044 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409671,409684] [2021-11-17 12:40:41,044 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409817,409830] [2021-11-17 12:40:41,044 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409962,409975] [2021-11-17 12:40:41,045 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410116,410129] [2021-11-17 12:40:41,045 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410267,410280] [2021-11-17 12:40:41,046 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410422,410435] [2021-11-17 12:40:41,049 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410574,410587] [2021-11-17 12:40:41,049 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410729,410742] [2021-11-17 12:40:41,050 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410893,410906] [2021-11-17 12:40:41,051 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411049,411062] [2021-11-17 12:40:41,051 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411213,411226] [2021-11-17 12:40:41,051 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411355,411368] [2021-11-17 12:40:41,054 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411513,411526] [2021-11-17 12:40:41,055 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411680,411693] [2021-11-17 12:40:41,055 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411839,411852] [2021-11-17 12:40:41,056 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411998,412011] [2021-11-17 12:40:41,056 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412147,412160] [2021-11-17 12:40:41,056 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412294,412307] [2021-11-17 12:40:41,058 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412433,412446] [2021-11-17 12:40:41,058 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412596,412609] [2021-11-17 12:40:41,059 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412762,412775] [2021-11-17 12:40:41,059 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412926,412939] [2021-11-17 12:40:41,060 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413091,413104] [2021-11-17 12:40:41,060 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413256,413269] [2021-11-17 12:40:41,061 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413422,413435] [2021-11-17 12:40:41,061 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413587,413600] [2021-11-17 12:40:41,062 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413754,413767] [2021-11-17 12:40:41,062 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413914,413927] [2021-11-17 12:40:41,062 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414076,414089] [2021-11-17 12:40:41,063 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414235,414248] [2021-11-17 12:40:41,063 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414381,414394] [2021-11-17 12:40:41,063 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414524,414537] [2021-11-17 12:40:41,063 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414668,414681] [2021-11-17 12:40:41,064 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414811,414824] [2021-11-17 12:40:41,064 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414955,414968] [2021-11-17 12:40:41,064 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415096,415109] [2021-11-17 12:40:41,065 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415234,415247] [2021-11-17 12:40:41,065 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415392,415405] [2021-11-17 12:40:41,065 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415551,415564] [2021-11-17 12:40:41,066 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415707,415720] [2021-11-17 12:40:41,066 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415856,415869] [2021-11-17 12:40:41,067 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416008,416021] [2021-11-17 12:40:41,067 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416159,416172] [2021-11-17 12:40:41,067 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416308,416321] [2021-11-17 12:40:41,067 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416460,416473] [2021-11-17 12:40:41,068 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416608,416621] [2021-11-17 12:40:41,068 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416761,416774] [2021-11-17 12:40:41,069 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416912,416925] [2021-11-17 12:40:41,069 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417062,417075] [2021-11-17 12:40:41,069 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417209,417222] [2021-11-17 12:40:41,069 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417360,417373] [2021-11-17 12:40:41,070 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417511,417524] [2021-11-17 12:40:41,070 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417659,417672] [2021-11-17 12:40:41,070 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417825,417838] [2021-11-17 12:40:41,071 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417994,418007] [2021-11-17 12:40:41,071 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418161,418174] [2021-11-17 12:40:41,071 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418329,418342] [2021-11-17 12:40:41,072 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418479,418492] [2021-11-17 12:40:41,072 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418626,418639] [2021-11-17 12:40:41,072 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418787,418800] [2021-11-17 12:40:41,072 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418957,418970] [2021-11-17 12:40:41,073 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[419119,419132] [2021-11-17 12:40:41,076 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:40:41,120 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 12:40:41,369 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405731,405744] [2021-11-17 12:40:41,370 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405876,405889] [2021-11-17 12:40:41,371 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406022,406035] [2021-11-17 12:40:41,371 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406187,406200] [2021-11-17 12:40:41,373 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406345,406358] [2021-11-17 12:40:41,376 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406503,406516] [2021-11-17 12:40:41,377 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406661,406674] [2021-11-17 12:40:41,377 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406821,406834] [2021-11-17 12:40:41,378 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406980,406993] [2021-11-17 12:40:41,378 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407119,407132] [2021-11-17 12:40:41,379 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407261,407274] [2021-11-17 12:40:41,379 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407410,407423] [2021-11-17 12:40:41,379 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407549,407562] [2021-11-17 12:40:41,380 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407704,407717] [2021-11-17 12:40:41,380 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407864,407877] [2021-11-17 12:40:41,380 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408015,408028] [2021-11-17 12:40:41,380 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408166,408179] [2021-11-17 12:40:41,381 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408318,408331] [2021-11-17 12:40:41,381 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408467,408480] [2021-11-17 12:40:41,381 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408615,408628] [2021-11-17 12:40:41,382 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408772,408785] [2021-11-17 12:40:41,383 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408921,408934] [2021-11-17 12:40:41,384 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409077,409090] [2021-11-17 12:40:41,384 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409230,409243] [2021-11-17 12:40:41,384 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409376,409389] [2021-11-17 12:40:41,384 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409519,409532] [2021-11-17 12:40:41,385 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409671,409684] [2021-11-17 12:40:41,385 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409817,409830] [2021-11-17 12:40:41,385 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409962,409975] [2021-11-17 12:40:41,386 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410116,410129] [2021-11-17 12:40:41,386 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410267,410280] [2021-11-17 12:40:41,386 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410422,410435] [2021-11-17 12:40:41,390 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410574,410587] [2021-11-17 12:40:41,390 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410729,410742] [2021-11-17 12:40:41,391 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410893,410906] [2021-11-17 12:40:41,391 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411049,411062] [2021-11-17 12:40:41,392 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411213,411226] [2021-11-17 12:40:41,392 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411355,411368] [2021-11-17 12:40:41,392 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411513,411526] [2021-11-17 12:40:41,393 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411680,411693] [2021-11-17 12:40:41,394 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411839,411852] [2021-11-17 12:40:41,394 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411998,412011] [2021-11-17 12:40:41,394 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412147,412160] [2021-11-17 12:40:41,395 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412294,412307] [2021-11-17 12:40:41,395 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412433,412446] [2021-11-17 12:40:41,395 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412596,412609] [2021-11-17 12:40:41,396 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412762,412775] [2021-11-17 12:40:41,396 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412926,412939] [2021-11-17 12:40:41,396 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413091,413104] [2021-11-17 12:40:41,396 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413256,413269] [2021-11-17 12:40:41,397 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413422,413435] [2021-11-17 12:40:41,397 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413587,413600] [2021-11-17 12:40:41,398 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413754,413767] [2021-11-17 12:40:41,398 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413914,413927] [2021-11-17 12:40:41,398 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414076,414089] [2021-11-17 12:40:41,399 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414235,414248] [2021-11-17 12:40:41,399 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414381,414394] [2021-11-17 12:40:41,400 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414524,414537] [2021-11-17 12:40:41,400 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414668,414681] [2021-11-17 12:40:41,401 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414811,414824] [2021-11-17 12:40:41,401 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414955,414968] [2021-11-17 12:40:41,402 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415096,415109] [2021-11-17 12:40:41,402 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415234,415247] [2021-11-17 12:40:41,404 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415392,415405] [2021-11-17 12:40:41,405 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415551,415564] [2021-11-17 12:40:41,405 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415707,415720] [2021-11-17 12:40:41,406 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415856,415869] [2021-11-17 12:40:41,406 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416008,416021] [2021-11-17 12:40:41,409 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416159,416172] [2021-11-17 12:40:41,410 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416308,416321] [2021-11-17 12:40:41,410 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416460,416473] [2021-11-17 12:40:41,411 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416608,416621] [2021-11-17 12:40:41,414 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416761,416774] [2021-11-17 12:40:41,414 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416912,416925] [2021-11-17 12:40:41,414 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417062,417075] [2021-11-17 12:40:41,415 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417209,417222] [2021-11-17 12:40:41,415 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417360,417373] [2021-11-17 12:40:41,415 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417511,417524] [2021-11-17 12:40:41,415 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417659,417672] [2021-11-17 12:40:41,416 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417825,417838] [2021-11-17 12:40:41,416 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417994,418007] [2021-11-17 12:40:41,416 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418161,418174] [2021-11-17 12:40:41,417 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418329,418342] [2021-11-17 12:40:41,417 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418479,418492] [2021-11-17 12:40:41,417 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418626,418639] [2021-11-17 12:40:41,417 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418787,418800] [2021-11-17 12:40:41,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418957,418970] [2021-11-17 12:40:41,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[419119,419132] [2021-11-17 12:40:41,420 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:40:41,535 INFO L208 MainTranslator]: Completed translation [2021-11-17 12:40:41,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41 WrapperNode [2021-11-17 12:40:41,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 12:40:41,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 12:40:41,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 12:40:41,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 12:40:41,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,701 INFO L137 Inliner]: procedures = 553, calls = 2286, calls flagged for inlining = 242, calls inlined = 154, statements flattened = 4399 [2021-11-17 12:40:41,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 12:40:41,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 12:40:41,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 12:40:41,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 12:40:41,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 12:40:41,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 12:40:41,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 12:40:41,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 12:40:41,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (1/1) ... [2021-11-17 12:40:41,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:40:41,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:40:41,937 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-11-17 12:40:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:40:41,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:40:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 12:40:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 12:40:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 12:40:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 12:40:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:40:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:40:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2021-11-17 12:40:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2021-11-17 12:40:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:40:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:40:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2021-11-17 12:40:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2021-11-17 12:40:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:40:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:40:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-17 12:40:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 12:40:41,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 12:40:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 12:40:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 12:40:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:40:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:40:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure tda1004x_writereg [2021-11-17 12:40:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure tda1004x_writereg [2021-11-17 12:40:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 12:40:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:40:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:40:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 12:40:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2021-11-17 12:40:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2021-11-17 12:40:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2021-11-17 12:40:41,959 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-11-17 12:40:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2021-11-17 12:40:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 12:40:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-11-17 12:40:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-11-17 12:40:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 12:40:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 12:40:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:40:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:40:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 12:40:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:40:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:40:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_frontend_detach [2021-11-17 12:40:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_frontend_detach [2021-11-17 12:40:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 12:40:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 12:40:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:40:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:40:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 12:40:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 12:40:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_stop_iso_xfer [2021-11-17 12:40:41,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_stop_iso_xfer [2021-11-17 12:40:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:40:41,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:40:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:40:41,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:40:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_cmd [2021-11-17 12:40:41,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_cmd [2021-11-17 12:40:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 12:40:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 12:40:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 12:40:41,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 12:40:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 12:40:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-17 12:40:41,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-17 12:40:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-11-17 12:40:41,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-11-17 12:40:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:40:41,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:40:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2021-11-17 12:40:41,977 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2021-11-17 12:40:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_del_adapter [2021-11-17 12:40:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_del_adapter [2021-11-17 12:40:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_free_iso_urbs [2021-11-17 12:40:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_free_iso_urbs [2021-11-17 12:40:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 12:40:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 12:40:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2021-11-17 12:40:41,980 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2021-11-17 12:40:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 12:40:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 12:40:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 12:40:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 12:40:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2021-11-17 12:40:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2021-11-17 12:40:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 12:40:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 12:40:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:40:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:40:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:40:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:40:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 12:40:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:40:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:40:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semusb_of_ttusb [2021-11-17 12:40:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semusb_of_ttusb [2021-11-17 12:40:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 12:40:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-11-17 12:40:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-11-17 12:40:41,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 12:40:41,983 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2021-11-17 12:40:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2021-11-17 12:40:41,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:40:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:40:41,983 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-11-17 12:40:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-11-17 12:40:41,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 12:40:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 12:40:41,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 12:40:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 12:40:41,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-11-17 12:40:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-11-17 12:40:41,984 INFO L130 BoogieDeclarations]: Found specification of procedure master_xfer [2021-11-17 12:40:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure master_xfer [2021-11-17 12:40:41,984 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2021-11-17 12:40:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2021-11-17 12:40:41,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:40:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:40:41,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:40:41,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:40:41,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:40:41,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:40:41,985 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2021-11-17 12:40:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2021-11-17 12:40:41,986 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-11-17 12:40:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-11-17 12:40:41,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:40:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:40:41,986 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 12:40:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 12:40:41,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:40:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:40:41,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 12:40:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:40:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:40:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semi2c_of_ttusb [2021-11-17 12:40:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semi2c_of_ttusb [2021-11-17 12:40:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_transfer [2021-11-17 12:40:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_transfer [2021-11-17 12:40:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 12:40:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 12:40:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:40:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:40:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_semi2c_of_ttusb [2021-11-17 12:40:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_semi2c_of_ttusb [2021-11-17 12:40:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_disconnect [2021-11-17 12:40:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_disconnect [2021-11-17 12:40:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_get [2021-11-17 12:40:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_get [2021-11-17 12:40:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 12:40:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 12:40:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:40:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:40:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2021-11-17 12:40:41,989 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2021-11-17 12:40:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_result [2021-11-17 12:40:41,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_result [2021-11-17 12:40:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 12:40:42,484 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 12:40:42,486 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 12:40:42,723 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 12:40:51,236 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 12:40:51,252 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 12:40:51,252 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-17 12:40:51,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:40:51 BoogieIcfgContainer [2021-11-17 12:40:51,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 12:40:51,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 12:40:51,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 12:40:51,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 12:40:51,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:40:38" (1/3) ... [2021-11-17 12:40:51,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786fa27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:40:51, skipping insertion in model container [2021-11-17 12:40:51,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:40:41" (2/3) ... [2021-11-17 12:40:51,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786fa27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:40:51, skipping insertion in model container [2021-11-17 12:40:51,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:40:51" (3/3) ... [2021-11-17 12:40:51,263 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i [2021-11-17 12:40:51,267 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 12:40:51,267 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-11-17 12:40:51,302 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 12:40:51,306 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-11-17 12:40:51,306 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-11-17 12:40:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 1174 states, 820 states have (on average 1.3487804878048781) internal successors, (1106), 867 states have internal predecessors, (1106), 255 states have call successors, (255), 71 states have call predecessors, (255), 70 states have return successors, (251), 250 states have call predecessors, (251), 251 states have call successors, (251) [2021-11-17 12:40:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-17 12:40:51,336 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:40:51,337 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-11-17 12:40:51,337 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 26 more)] === [2021-11-17 12:40:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:40:51,341 INFO L85 PathProgramCache]: Analyzing trace with hash 145990740, now seen corresponding path program 1 times [2021-11-17 12:40:51,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:40:51,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038994171] [2021-11-17 12:40:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:40:51,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:40:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:40:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:40:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:51,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:40:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:40:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:51,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:40:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:40:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:52,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:40:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:52,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:40:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:40:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:40:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:40:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:40:52,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:40:52,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038994171] [2021-11-17 12:40:52,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038994171] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:40:52,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:40:52,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:40:52,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577584217] [2021-11-17 12:40:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:40:52,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:40:52,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:40:52,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:40:52,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:40:52,125 INFO L87 Difference]: Start difference. First operand has 1174 states, 820 states have (on average 1.3487804878048781) internal successors, (1106), 867 states have internal predecessors, (1106), 255 states have call successors, (255), 71 states have call predecessors, (255), 70 states have return successors, (251), 250 states have call predecessors, (251), 251 states have call successors, (251) 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-11-17 12:40:54,817 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:40:59,849 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:41:01,308 INFO L93 Difference]: Finished difference Result 2296 states and 3249 transitions. [2021-11-17 12:41:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:41:01,310 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-11-17 12:41:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:41:01,324 INFO L225 Difference]: With dead ends: 2296 [2021-11-17 12:41:01,324 INFO L226 Difference]: Without dead ends: 1157 [2021-11-17 12:41:01,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:41:01,334 INFO L933 BasicCegarLoop]: 1489 mSDtfsCounter, 2502 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 844 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 3188 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:41:01,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2660 Valid, 3188 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 1146 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2021-11-17 12:41:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2021-11-17 12:41:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2021-11-17 12:41:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 810 states have (on average 1.3074074074074074) internal successors, (1059), 853 states have internal predecessors, (1059), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2021-11-17 12:41:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1559 transitions. [2021-11-17 12:41:01,442 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1559 transitions. Word has length 71 [2021-11-17 12:41:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:41:01,443 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1559 transitions. [2021-11-17 12:41:01,443 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-11-17 12:41:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1559 transitions. [2021-11-17 12:41:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-17 12:41:01,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:41:01,450 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-11-17 12:41:01,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 12:41:01,451 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 26 more)] === [2021-11-17 12:41:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:41:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1717476351, now seen corresponding path program 1 times [2021-11-17 12:41:01,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:41:01,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024092576] [2021-11-17 12:41:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:41:01,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:41:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:41:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:41:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:41:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:41:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:41:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:41:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:41:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:41:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:41:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:41:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:41:01,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:41:01,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024092576] [2021-11-17 12:41:01,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024092576] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:41:01,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:41:01,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:41:01,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376427034] [2021-11-17 12:41:01,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:41:01,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:41:01,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:41:01,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:41:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:41:01,931 INFO L87 Difference]: Start difference. First operand 1157 states and 1559 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-11-17 12:41:08,052 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:41:09,642 INFO L93 Difference]: Finished difference Result 1157 states and 1559 transitions. [2021-11-17 12:41:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:41:09,643 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-11-17 12:41:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:41:09,652 INFO L225 Difference]: With dead ends: 1157 [2021-11-17 12:41:09,652 INFO L226 Difference]: Without dead ends: 1155 [2021-11-17 12:41:09,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:41:09,656 INFO L933 BasicCegarLoop]: 1471 mSDtfsCounter, 2470 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:41:09,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2625 Valid, 3152 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1135 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2021-11-17 12:41:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2021-11-17 12:41:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2021-11-17 12:41:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 809 states have (on average 1.3065512978986402) internal successors, (1057), 851 states have internal predecessors, (1057), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2021-11-17 12:41:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1557 transitions. [2021-11-17 12:41:09,719 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1557 transitions. Word has length 77 [2021-11-17 12:41:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:41:09,721 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 1557 transitions. [2021-11-17 12:41:09,721 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-11-17 12:41:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1557 transitions. [2021-11-17 12:41:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-17 12:41:09,723 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:41:09,724 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-11-17 12:41:09,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 12:41:09,724 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 26 more)] === [2021-11-17 12:41:09,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:41:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash -710014543, now seen corresponding path program 1 times [2021-11-17 12:41:09,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:41:09,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231920042] [2021-11-17 12:41:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:41:09,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:41:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:41:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:09,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:41:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:09,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:41:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:41:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:41:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:41:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:41:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:41:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:41:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:41:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:41:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:41:10,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:41:10,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231920042] [2021-11-17 12:41:10,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231920042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:41:10,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:41:10,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:41:10,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528530862] [2021-11-17 12:41:10,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:41:10,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:41:10,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:41:10,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:41:10,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:41:10,228 INFO L87 Difference]: Start difference. First operand 1155 states and 1557 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-11-17 12:41:11,342 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:41:15,663 INFO L93 Difference]: Finished difference Result 1155 states and 1557 transitions. [2021-11-17 12:41:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:41:15,664 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-11-17 12:41:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:41:15,669 INFO L225 Difference]: With dead ends: 1155 [2021-11-17 12:41:15,669 INFO L226 Difference]: Without dead ends: 1153 [2021-11-17 12:41:15,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:41:15,671 INFO L933 BasicCegarLoop]: 1469 mSDtfsCounter, 2464 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:41:15,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2618 Valid, 3150 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2021-11-17 12:41:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-11-17 12:41:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2021-11-17 12:41:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 808 states have (on average 1.3056930693069306) internal successors, (1055), 849 states have internal predecessors, (1055), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2021-11-17 12:41:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1555 transitions. [2021-11-17 12:41:15,710 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1555 transitions. Word has length 83 [2021-11-17 12:41:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:41:15,712 INFO L470 AbstractCegarLoop]: Abstraction has 1153 states and 1555 transitions. [2021-11-17 12:41:15,712 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-11-17 12:41:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1555 transitions. [2021-11-17 12:41:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-17 12:41:15,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:41:15,714 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-11-17 12:41:15,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 12:41:15,714 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 26 more)] === [2021-11-17 12:41:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:41:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2116367515, now seen corresponding path program 1 times [2021-11-17 12:41:15,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:41:15,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527769786] [2021-11-17 12:41:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:41:15,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:41:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:15,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:41:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:41:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:15,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:41:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:41:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:41:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:41:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:41:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:41:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:41:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:41:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:41:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:41:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:41:16,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:41:16,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527769786] [2021-11-17 12:41:16,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527769786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:41:16,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:41:16,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:41:16,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457519023] [2021-11-17 12:41:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:41:16,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:41:16,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:41:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:41:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:41:16,086 INFO L87 Difference]: Start difference. First operand 1153 states and 1555 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-11-17 12:41:17,592 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:19,426 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:24,351 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:41:25,811 INFO L93 Difference]: Finished difference Result 1153 states and 1555 transitions. [2021-11-17 12:41:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:41:25,812 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-11-17 12:41:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:41:25,817 INFO L225 Difference]: With dead ends: 1153 [2021-11-17 12:41:25,817 INFO L226 Difference]: Without dead ends: 1151 [2021-11-17 12:41:25,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:41:25,818 INFO L933 BasicCegarLoop]: 1467 mSDtfsCounter, 2458 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:41:25,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2611 Valid, 3148 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1131 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2021-11-17 12:41:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2021-11-17 12:41:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2021-11-17 12:41:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 807 states have (on average 1.304832713754647) internal successors, (1053), 847 states have internal predecessors, (1053), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2021-11-17 12:41:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1553 transitions. [2021-11-17 12:41:25,853 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1553 transitions. Word has length 89 [2021-11-17 12:41:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:41:25,854 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 1553 transitions. [2021-11-17 12:41:25,854 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-11-17 12:41:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1553 transitions. [2021-11-17 12:41:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-17 12:41:25,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:41:25,858 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-11-17 12:41:25,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 12:41:25,859 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 26 more)] === [2021-11-17 12:41:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:41:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1681490694, now seen corresponding path program 1 times [2021-11-17 12:41:25,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:41:25,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616051153] [2021-11-17 12:41:25,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:41:25,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:41:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:41:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:41:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:41:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:41:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:41:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:41:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:41:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:41:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:41:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:41:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:41:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:41:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:41:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:41:26,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:41:26,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616051153] [2021-11-17 12:41:26,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616051153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:41:26,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:41:26,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:41:26,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848969509] [2021-11-17 12:41:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:41:26,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:41:26,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:41:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:41:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:41:26,297 INFO L87 Difference]: Start difference. First operand 1151 states and 1553 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-11-17 12:41:28,321 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:30,388 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:41:34,396 INFO L93 Difference]: Finished difference Result 1151 states and 1553 transitions. [2021-11-17 12:41:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:41:34,396 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-11-17 12:41:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:41:34,402 INFO L225 Difference]: With dead ends: 1151 [2021-11-17 12:41:34,402 INFO L226 Difference]: Without dead ends: 1149 [2021-11-17 12:41:34,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:41:34,405 INFO L933 BasicCegarLoop]: 1465 mSDtfsCounter, 2452 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:41:34,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2604 Valid, 3146 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1128 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2021-11-17 12:41:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2021-11-17 12:41:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2021-11-17 12:41:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 806 states have (on average 1.303970223325062) internal successors, (1051), 845 states have internal predecessors, (1051), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2021-11-17 12:41:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1551 transitions. [2021-11-17 12:41:34,438 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1551 transitions. Word has length 95 [2021-11-17 12:41:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:41:34,440 INFO L470 AbstractCegarLoop]: Abstraction has 1149 states and 1551 transitions. [2021-11-17 12:41:34,440 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-11-17 12:41:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1551 transitions. [2021-11-17 12:41:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-17 12:41:34,441 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:41:34,441 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-11-17 12:41:34,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 12:41:34,442 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 26 more)] === [2021-11-17 12:41:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:41:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 658495343, now seen corresponding path program 1 times [2021-11-17 12:41:34,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:41:34,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658656418] [2021-11-17 12:41:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:41:34,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:41:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:41:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:41:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:41:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:41:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:41:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:41:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:41:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:41:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:41:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:41:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:41:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:41:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:41:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:41:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:41:34,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:41:34,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658656418] [2021-11-17 12:41:34,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658656418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:41:34,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:41:34,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:41:34,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501259123] [2021-11-17 12:41:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:41:34,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:41:34,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:41:34,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:41:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:41:34,830 INFO L87 Difference]: Start difference. First operand 1149 states and 1551 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-11-17 12:41:36,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:38,755 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:43,535 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:41:44,849 INFO L93 Difference]: Finished difference Result 1149 states and 1551 transitions. [2021-11-17 12:41:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:41:44,849 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-11-17 12:41:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:41:44,854 INFO L225 Difference]: With dead ends: 1149 [2021-11-17 12:41:44,854 INFO L226 Difference]: Without dead ends: 1147 [2021-11-17 12:41:44,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:41:44,855 INFO L933 BasicCegarLoop]: 1463 mSDtfsCounter, 2446 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 3144 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:41:44,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2597 Valid, 3144 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1126 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2021-11-17 12:41:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-11-17 12:41:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2021-11-17 12:41:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 805 states have (on average 1.3031055900621118) internal successors, (1049), 843 states have internal predecessors, (1049), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2021-11-17 12:41:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1549 transitions. [2021-11-17 12:41:44,885 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1549 transitions. Word has length 101 [2021-11-17 12:41:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:41:44,886 INFO L470 AbstractCegarLoop]: Abstraction has 1147 states and 1549 transitions. [2021-11-17 12:41:44,886 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-11-17 12:41:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1549 transitions. [2021-11-17 12:41:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-17 12:41:44,887 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:41:44,887 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:41:44,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 12:41:44,887 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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 26 more)] === [2021-11-17 12:41:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:41:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1011873192, now seen corresponding path program 1 times [2021-11-17 12:41:44,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:41:44,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924716982] [2021-11-17 12:41:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:41:44,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:41:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:41:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:41:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:41:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:41:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:41:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:41:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:41:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:41:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:41:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:41:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:41:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:41:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:41:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:41:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:41:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:41:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:41:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-11-17 12:41:45,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:41:45,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924716982] [2021-11-17 12:41:45,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924716982] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:41:45,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:41:45,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:41:45,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475811382] [2021-11-17 12:41:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:41:45,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:41:45,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:41:45,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:41:45,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:41:45,344 INFO L87 Difference]: Start difference. First operand 1147 states and 1549 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:41:48,206 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:41:55,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:01,385 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:03,575 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:05,832 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:11,640 INFO L93 Difference]: Finished difference Result 1986 states and 2671 transitions. [2021-11-17 12:42:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 12:42:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2021-11-17 12:42:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:11,650 INFO L225 Difference]: With dead ends: 1986 [2021-11-17 12:42:11,651 INFO L226 Difference]: Without dead ends: 1984 [2021-11-17 12:42:11,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2021-11-17 12:42:11,654 INFO L933 BasicCegarLoop]: 1710 mSDtfsCounter, 3860 mSDsluCounter, 3707 mSDsCounter, 0 mSdLazyCounter, 4074 mSolverCounterSat, 1803 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3989 SdHoareTripleChecker+Valid, 5417 SdHoareTripleChecker+Invalid, 5882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 4074 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:11,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3989 Valid, 5417 Invalid, 5882 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1803 Valid, 4074 Invalid, 5 Unknown, 0 Unchecked, 25.5s Time] [2021-11-17 12:42:11,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2021-11-17 12:42:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1727. [2021-11-17 12:42:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1236 states have (on average 1.3098705501618122) internal successors, (1619), 1277 states have internal predecessors, (1619), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2021-11-17 12:42:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2359 transitions. [2021-11-17 12:42:11,797 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2359 transitions. Word has length 115 [2021-11-17 12:42:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:11,797 INFO L470 AbstractCegarLoop]: Abstraction has 1727 states and 2359 transitions. [2021-11-17 12:42:11,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 12:42:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2359 transitions. [2021-11-17 12:42:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-17 12:42:11,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:11,800 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-11-17 12:42:11,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 12:42:11,801 INFO L402 AbstractCegarLoop]: === Iteration 8 === 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 26 more)] === [2021-11-17 12:42:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1214019974, now seen corresponding path program 1 times [2021-11-17 12:42:11,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:11,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59344034] [2021-11-17 12:42:11,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:11,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:11,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:11,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:42:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:42:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:42:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:42:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:42:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:42:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:42:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:42:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:42:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:42:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:42:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:42:12,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:12,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59344034] [2021-11-17 12:42:12,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59344034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:12,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:12,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:42:12,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664391306] [2021-11-17 12:42:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:12,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:42:12,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:12,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:42:12,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:42:12,137 INFO L87 Difference]: Start difference. First operand 1727 states and 2359 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-11-17 12:42:14,036 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:17,847 INFO L93 Difference]: Finished difference Result 1727 states and 2359 transitions. [2021-11-17 12:42:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:42:17,848 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-11-17 12:42:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:17,855 INFO L225 Difference]: With dead ends: 1727 [2021-11-17 12:42:17,855 INFO L226 Difference]: Without dead ends: 1725 [2021-11-17 12:42:17,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:42:17,856 INFO L933 BasicCegarLoop]: 1461 mSDtfsCounter, 2440 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:17,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2590 Valid, 3142 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2021-11-17 12:42:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2021-11-17 12:42:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1725. [2021-11-17 12:42:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1235 states have (on average 1.3093117408906882) internal successors, (1617), 1275 states have internal predecessors, (1617), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2021-11-17 12:42:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2357 transitions. [2021-11-17 12:42:17,986 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2357 transitions. Word has length 107 [2021-11-17 12:42:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:17,986 INFO L470 AbstractCegarLoop]: Abstraction has 1725 states and 2357 transitions. [2021-11-17 12:42:17,986 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-11-17 12:42:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2357 transitions. [2021-11-17 12:42:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-17 12:42:17,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:17,993 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-11-17 12:42:17,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 12:42:17,993 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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 26 more)] === [2021-11-17 12:42:17,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash 816117705, now seen corresponding path program 1 times [2021-11-17 12:42:17,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:17,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035149911] [2021-11-17 12:42:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:17,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:42:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:42:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:42:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:42:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:42:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:42:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:42:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:42:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:42:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:42:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:42:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:42:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:42:18,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:18,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035149911] [2021-11-17 12:42:18,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035149911] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:18,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:18,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:42:18,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372931086] [2021-11-17 12:42:18,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:18,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:42:18,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:42:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:42:18,332 INFO L87 Difference]: Start difference. First operand 1725 states and 2357 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-11-17 12:42:23,595 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:24,860 INFO L93 Difference]: Finished difference Result 1725 states and 2357 transitions. [2021-11-17 12:42:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:42:24,862 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-11-17 12:42:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:24,867 INFO L225 Difference]: With dead ends: 1725 [2021-11-17 12:42:24,867 INFO L226 Difference]: Without dead ends: 1723 [2021-11-17 12:42:24,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:42:24,868 INFO L933 BasicCegarLoop]: 1459 mSDtfsCounter, 2438 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:24,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2587 Valid, 3140 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1119 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2021-11-17 12:42:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2021-11-17 12:42:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2021-11-17 12:42:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1234 states have (on average 1.3087520259319287) internal successors, (1615), 1273 states have internal predecessors, (1615), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2021-11-17 12:42:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2355 transitions. [2021-11-17 12:42:24,917 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2355 transitions. Word has length 113 [2021-11-17 12:42:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:24,918 INFO L470 AbstractCegarLoop]: Abstraction has 1723 states and 2355 transitions. [2021-11-17 12:42:24,918 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-11-17 12:42:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2355 transitions. [2021-11-17 12:42:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-17 12:42:24,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:24,919 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-11-17 12:42:24,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 12:42:24,919 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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 26 more)] === [2021-11-17 12:42:24,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1689744756, now seen corresponding path program 1 times [2021-11-17 12:42:24,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:24,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229781404] [2021-11-17 12:42:24,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:24,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:42:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:42:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:42:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:42:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:42:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:42:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:42:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:42:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:42:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:42:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:42:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:42:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:42:25,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:25,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229781404] [2021-11-17 12:42:25,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229781404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:25,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:25,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:42:25,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87625277] [2021-11-17 12:42:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:25,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:42:25,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:42:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:42:25,242 INFO L87 Difference]: Start difference. First operand 1723 states and 2355 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-11-17 12:42:31,202 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:32,651 INFO L93 Difference]: Finished difference Result 1723 states and 2355 transitions. [2021-11-17 12:42:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:42:32,652 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-11-17 12:42:32,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:32,658 INFO L225 Difference]: With dead ends: 1723 [2021-11-17 12:42:32,658 INFO L226 Difference]: Without dead ends: 1721 [2021-11-17 12:42:32,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:42:32,660 INFO L933 BasicCegarLoop]: 1457 mSDtfsCounter, 2426 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:32,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2575 Valid, 3138 Invalid, 1958 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [836 Valid, 1121 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2021-11-17 12:42:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2021-11-17 12:42:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2021-11-17 12:42:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1233 states have (on average 1.308191403081914) internal successors, (1613), 1271 states have internal predecessors, (1613), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2021-11-17 12:42:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2353 transitions. [2021-11-17 12:42:32,732 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2353 transitions. Word has length 115 [2021-11-17 12:42:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:32,733 INFO L470 AbstractCegarLoop]: Abstraction has 1721 states and 2353 transitions. [2021-11-17 12:42:32,734 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-11-17 12:42:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2353 transitions. [2021-11-17 12:42:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-17 12:42:32,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:32,735 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] [2021-11-17 12:42:32,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 12:42:32,736 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:42:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash 435234058, now seen corresponding path program 1 times [2021-11-17 12:42:32,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:32,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696289115] [2021-11-17 12:42:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:32,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:42:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:42:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:42:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:42:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:42:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:42:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:42:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 12:42:33,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:33,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696289115] [2021-11-17 12:42:33,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696289115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:33,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:33,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:42:33,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401402337] [2021-11-17 12:42:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:33,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:42:33,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:42:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:42:33,141 INFO L87 Difference]: Start difference. First operand 1721 states and 2353 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:42:37,111 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:41,154 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:42,982 INFO L93 Difference]: Finished difference Result 3458 states and 4792 transitions. [2021-11-17 12:42:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:42:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2021-11-17 12:42:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:42,991 INFO L225 Difference]: With dead ends: 3458 [2021-11-17 12:42:42,992 INFO L226 Difference]: Without dead ends: 1775 [2021-11-17 12:42:42,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:42:43,000 INFO L933 BasicCegarLoop]: 1431 mSDtfsCounter, 2711 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 1210 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2884 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1210 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:43,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2884 Valid, 2679 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1210 Valid, 992 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2021-11-17 12:42:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2021-11-17 12:42:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1711. [2021-11-17 12:42:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1223 states have (on average 1.2902698282910874) internal successors, (1578), 1261 states have internal predecessors, (1578), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2021-11-17 12:42:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2318 transitions. [2021-11-17 12:42:43,080 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2318 transitions. Word has length 157 [2021-11-17 12:42:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:43,080 INFO L470 AbstractCegarLoop]: Abstraction has 1711 states and 2318 transitions. [2021-11-17 12:42:43,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:42:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2318 transitions. [2021-11-17 12:42:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-17 12:42:43,088 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:43,088 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] [2021-11-17 12:42:43,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 12:42:43,089 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:42:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:43,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1115292428, now seen corresponding path program 1 times [2021-11-17 12:42:43,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:43,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537160562] [2021-11-17 12:42:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:43,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:42:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:42:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:42:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:42:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:42:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:42:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:42:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 12:42:43,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:43,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537160562] [2021-11-17 12:42:43,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537160562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:43,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:43,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:42:43,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153163979] [2021-11-17 12:42:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:43,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:42:43,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:42:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:42:43,586 INFO L87 Difference]: Start difference. First operand 1711 states and 2318 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:42:47,561 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:51,218 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:42:53,491 INFO L93 Difference]: Finished difference Result 3066 states and 4139 transitions. [2021-11-17 12:42:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 12:42:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2021-11-17 12:42:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:42:53,500 INFO L225 Difference]: With dead ends: 3066 [2021-11-17 12:42:53,500 INFO L226 Difference]: Without dead ends: 1771 [2021-11-17 12:42:53,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:42:53,505 INFO L933 BasicCegarLoop]: 1271 mSDtfsCounter, 2717 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 1202 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1202 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:42:53,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2897 Valid, 2476 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1202 Valid, 1173 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2021-11-17 12:42:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2021-11-17 12:42:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1707. [2021-11-17 12:42:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1220 states have (on average 1.289344262295082) internal successors, (1573), 1257 states have internal predecessors, (1573), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2021-11-17 12:42:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2313 transitions. [2021-11-17 12:42:53,570 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2313 transitions. Word has length 157 [2021-11-17 12:42:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:42:53,570 INFO L470 AbstractCegarLoop]: Abstraction has 1707 states and 2313 transitions. [2021-11-17 12:42:53,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 12:42:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2313 transitions. [2021-11-17 12:42:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-17 12:42:53,572 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:42:53,572 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:42:53,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 12:42:53,572 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:42:53,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:42:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1141865086, now seen corresponding path program 1 times [2021-11-17 12:42:53,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:42:53,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029684184] [2021-11-17 12:42:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:42:53,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:42:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:42:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:42:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:42:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:42:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:42:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:42:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:42:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:42:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:42:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:42:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:42:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:42:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:42:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:42:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:42:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:53,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:42:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:42:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:54,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:42:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:42:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-17 12:42:54,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:42:54,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029684184] [2021-11-17 12:42:54,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029684184] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:42:54,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:42:54,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:42:54,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753962711] [2021-11-17 12:42:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:42:54,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:42:54,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:42:54,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:42:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:42:54,025 INFO L87 Difference]: Start difference. First operand 1707 states and 2313 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 5 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 12:42:56,048 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:42:58,120 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:05,745 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:14,288 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:16,416 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:18,552 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:20,688 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:43:24,581 INFO L93 Difference]: Finished difference Result 3182 states and 4344 transitions. [2021-11-17 12:43:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 12:43:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 5 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 133 [2021-11-17 12:43:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:43:24,588 INFO L225 Difference]: With dead ends: 3182 [2021-11-17 12:43:24,589 INFO L226 Difference]: Without dead ends: 1929 [2021-11-17 12:43:24,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-11-17 12:43:24,592 INFO L933 BasicCegarLoop]: 1442 mSDtfsCounter, 1933 mSDsluCounter, 4623 mSDsCounter, 0 mSdLazyCounter, 3892 mSolverCounterSat, 1081 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 6065 SdHoareTripleChecker+Invalid, 4980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 3892 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:43:24,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1933 Valid, 6065 Invalid, 4980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1081 Valid, 3892 Invalid, 7 Unknown, 0 Unchecked, 29.9s Time] [2021-11-17 12:43:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2021-11-17 12:43:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1804. [2021-11-17 12:43:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1300 states have (on average 1.2961538461538462) internal successors, (1685), 1341 states have internal predecessors, (1685), 366 states have call successors, (366), 117 states have call predecessors, (366), 120 states have return successors, (415), 361 states have call predecessors, (415), 364 states have call successors, (415) [2021-11-17 12:43:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2466 transitions. [2021-11-17 12:43:24,655 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2466 transitions. Word has length 133 [2021-11-17 12:43:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:43:24,655 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2466 transitions. [2021-11-17 12:43:24,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 5 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 12:43:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2466 transitions. [2021-11-17 12:43:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-17 12:43:24,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:43:24,657 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-11-17 12:43:24,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 12:43:24,657 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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 26 more)] === [2021-11-17 12:43:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:43:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash 300729364, now seen corresponding path program 1 times [2021-11-17 12:43:24,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:43:24,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30866197] [2021-11-17 12:43:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:43:24,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:43:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:43:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:43:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:43:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:43:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:43:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:43:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:43:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:43:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:43:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:43:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:43:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:43:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:43:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:43:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:43:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:43:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:43:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:43:24,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:43:24,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30866197] [2021-11-17 12:43:24,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30866197] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:43:24,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:43:24,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:43:24,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773489926] [2021-11-17 12:43:24,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:43:24,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:43:24,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:43:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:43:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:43:24,993 INFO L87 Difference]: Start difference. First operand 1804 states and 2466 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-11-17 12:43:27,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:32,360 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:43:34,076 INFO L93 Difference]: Finished difference Result 1804 states and 2466 transitions. [2021-11-17 12:43:34,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:43:34,076 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-11-17 12:43:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:43:34,083 INFO L225 Difference]: With dead ends: 1804 [2021-11-17 12:43:34,084 INFO L226 Difference]: Without dead ends: 1802 [2021-11-17 12:43:34,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:43:34,085 INFO L933 BasicCegarLoop]: 1430 mSDtfsCounter, 2367 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:43:34,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2515 Valid, 3082 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1102 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2021-11-17 12:43:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2021-11-17 12:43:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2021-11-17 12:43:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1299 states have (on average 1.2956120092378753) internal successors, (1683), 1339 states have internal predecessors, (1683), 366 states have call successors, (366), 117 states have call predecessors, (366), 120 states have return successors, (415), 361 states have call predecessors, (415), 364 states have call successors, (415) [2021-11-17 12:43:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2464 transitions. [2021-11-17 12:43:34,161 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2464 transitions. Word has length 121 [2021-11-17 12:43:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:43:34,161 INFO L470 AbstractCegarLoop]: Abstraction has 1802 states and 2464 transitions. [2021-11-17 12:43:34,161 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-11-17 12:43:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2464 transitions. [2021-11-17 12:43:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 12:43:34,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:43:34,164 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 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] [2021-11-17 12:43:34,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 12:43:34,165 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:43:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:43:34,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1806280261, now seen corresponding path program 1 times [2021-11-17 12:43:34,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:43:34,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242246980] [2021-11-17 12:43:34,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:43:34,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:43:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:43:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:43:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:43:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:43:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:43:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:43:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:43:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:43:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:43:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:43:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:43:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 12:43:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2021-11-17 12:43:34,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:43:34,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242246980] [2021-11-17 12:43:34,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242246980] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:43:34,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413456083] [2021-11-17 12:43:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:43:34,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:43:34,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:43:34,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:43:34,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 12:43:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:35,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 12:43:35,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:43:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 12:43:35,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:43:35,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413456083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:43:35,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 12:43:35,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-11-17 12:43:35,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452303699] [2021-11-17 12:43:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:43:35,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 12:43:35,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:43:35,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 12:43:35,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:43:35,759 INFO L87 Difference]: Start difference. First operand 1802 states and 2464 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:43:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:43:35,885 INFO L93 Difference]: Finished difference Result 3237 states and 4393 transitions. [2021-11-17 12:43:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 12:43:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 163 [2021-11-17 12:43:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:43:35,895 INFO L225 Difference]: With dead ends: 3237 [2021-11-17 12:43:35,895 INFO L226 Difference]: Without dead ends: 1854 [2021-11-17 12:43:35,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:43:35,904 INFO L933 BasicCegarLoop]: 1575 mSDtfsCounter, 1492 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:43:35,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1492 Valid, 1642 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 12:43:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2021-11-17 12:43:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1851. [2021-11-17 12:43:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1328 states have (on average 1.2899096385542168) internal successors, (1713), 1371 states have internal predecessors, (1713), 381 states have call successors, (381), 123 states have call predecessors, (381), 126 states have return successors, (430), 374 states have call predecessors, (430), 379 states have call successors, (430) [2021-11-17 12:43:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2524 transitions. [2021-11-17 12:43:35,998 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2524 transitions. Word has length 163 [2021-11-17 12:43:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:43:36,000 INFO L470 AbstractCegarLoop]: Abstraction has 1851 states and 2524 transitions. [2021-11-17 12:43:36,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:43:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2524 transitions. [2021-11-17 12:43:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-17 12:43:36,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:43:36,003 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] [2021-11-17 12:43:36,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-17 12:43:36,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-17 12:43:36,228 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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 26 more)] === [2021-11-17 12:43:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:43:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1388180961, now seen corresponding path program 1 times [2021-11-17 12:43:36,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:43:36,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300414444] [2021-11-17 12:43:36,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:43:36,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:43:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:43:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:43:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:43:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:43:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:43:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:43:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:43:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:43:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:43:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:43:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:43:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 12:43:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 12:43:37,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:43:37,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300414444] [2021-11-17 12:43:37,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300414444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:43:37,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:43:37,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:43:37,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738653036] [2021-11-17 12:43:37,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:43:37,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:43:37,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:43:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:43:37,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:43:37,010 INFO L87 Difference]: Start difference. First operand 1851 states and 2524 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:43:44,064 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:50,805 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:53,002 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:55,274 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:43:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:43:59,321 INFO L93 Difference]: Finished difference Result 3679 states and 5050 transitions. [2021-11-17 12:43:59,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 12:43:59,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 165 [2021-11-17 12:43:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:43:59,329 INFO L225 Difference]: With dead ends: 3679 [2021-11-17 12:43:59,329 INFO L226 Difference]: Without dead ends: 1923 [2021-11-17 12:43:59,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-11-17 12:43:59,335 INFO L933 BasicCegarLoop]: 1432 mSDtfsCounter, 2676 mSDsluCounter, 3307 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 1197 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2849 SdHoareTripleChecker+Valid, 4739 SdHoareTripleChecker+Invalid, 4716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1197 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:43:59,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2849 Valid, 4739 Invalid, 4716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1197 Valid, 3515 Invalid, 4 Unknown, 0 Unchecked, 21.8s Time] [2021-11-17 12:43:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2021-11-17 12:43:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1851. [2021-11-17 12:43:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1328 states have (on average 1.2884036144578312) internal successors, (1711), 1371 states have internal predecessors, (1711), 381 states have call successors, (381), 123 states have call predecessors, (381), 126 states have return successors, (430), 374 states have call predecessors, (430), 379 states have call successors, (430) [2021-11-17 12:43:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2522 transitions. [2021-11-17 12:43:59,413 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2522 transitions. Word has length 165 [2021-11-17 12:43:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:43:59,413 INFO L470 AbstractCegarLoop]: Abstraction has 1851 states and 2522 transitions. [2021-11-17 12:43:59,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 12:43:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2522 transitions. [2021-11-17 12:43:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-17 12:43:59,415 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:43:59,415 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] [2021-11-17 12:43:59,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 12:43:59,416 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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 26 more)] === [2021-11-17 12:43:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:43:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1388240543, now seen corresponding path program 1 times [2021-11-17 12:43:59,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:43:59,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271454557] [2021-11-17 12:43:59,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:43:59,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:43:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:43:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:43:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:43:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:43:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:43:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:43:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:43:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:43:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:43:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:43:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:43:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:43:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:43:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:43:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 12:43:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:43:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 12:43:59,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:43:59,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271454557] [2021-11-17 12:43:59,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271454557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:43:59,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:43:59,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:43:59,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478501121] [2021-11-17 12:43:59,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:43:59,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:43:59,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:43:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:43:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:43:59,841 INFO L87 Difference]: Start difference. First operand 1851 states and 2522 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-17 12:44:01,865 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:07,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:13,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:15,657 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:44:18,630 INFO L93 Difference]: Finished difference Result 1923 states and 2636 transitions. [2021-11-17 12:44:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:44:18,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 165 [2021-11-17 12:44:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:44:18,638 INFO L225 Difference]: With dead ends: 1923 [2021-11-17 12:44:18,638 INFO L226 Difference]: Without dead ends: 1921 [2021-11-17 12:44:18,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-17 12:44:18,640 INFO L933 BasicCegarLoop]: 1431 mSDtfsCounter, 1529 mSDsluCounter, 2901 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 999 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 3376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 999 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:44:18,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 4332 Invalid, 3376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [999 Valid, 2373 Invalid, 4 Unknown, 0 Unchecked, 18.4s Time] [2021-11-17 12:44:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2021-11-17 12:44:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1849. [2021-11-17 12:44:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1327 states have (on average 1.2871137905048982) internal successors, (1708), 1369 states have internal predecessors, (1708), 381 states have call successors, (381), 123 states have call predecessors, (381), 126 states have return successors, (430), 374 states have call predecessors, (430), 379 states have call successors, (430) [2021-11-17 12:44:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2519 transitions. [2021-11-17 12:44:18,718 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2519 transitions. Word has length 165 [2021-11-17 12:44:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:44:18,718 INFO L470 AbstractCegarLoop]: Abstraction has 1849 states and 2519 transitions. [2021-11-17 12:44:18,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-17 12:44:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2519 transitions. [2021-11-17 12:44:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-17 12:44:18,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:44:18,721 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-11-17 12:44:18,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 12:44:18,721 INFO L402 AbstractCegarLoop]: === Iteration 18 === 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 26 more)] === [2021-11-17 12:44:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:44:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash 754662761, now seen corresponding path program 1 times [2021-11-17 12:44:18,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:44:18,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856978041] [2021-11-17 12:44:18,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:44:18,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:44:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:44:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:18,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:44:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:44:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:44:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:18,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:44:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:44:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:18,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:44:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:44:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:44:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:44:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:44:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:44:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:44:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:44:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:44:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:44:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:44:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:44:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:44:19,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:44:19,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856978041] [2021-11-17 12:44:19,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856978041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:44:19,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:44:19,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:44:19,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639353384] [2021-11-17 12:44:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:44:19,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:44:19,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:44:19,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:44:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:44:19,113 INFO L87 Difference]: Start difference. First operand 1849 states and 2519 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-11-17 12:44:20,448 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:44:25,210 INFO L93 Difference]: Finished difference Result 1849 states and 2519 transitions. [2021-11-17 12:44:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:44:25,211 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-11-17 12:44:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:44:25,221 INFO L225 Difference]: With dead ends: 1849 [2021-11-17 12:44:25,221 INFO L226 Difference]: Without dead ends: 1847 [2021-11-17 12:44:25,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:44:25,223 INFO L933 BasicCegarLoop]: 1420 mSDtfsCounter, 2347 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:44:25,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2494 Valid, 3058 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2021-11-17 12:44:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2021-11-17 12:44:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2021-11-17 12:44:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1326 states have (on average 1.2865761689291102) internal successors, (1706), 1367 states have internal predecessors, (1706), 381 states have call successors, (381), 123 states have call predecessors, (381), 126 states have return successors, (430), 374 states have call predecessors, (430), 379 states have call successors, (430) [2021-11-17 12:44:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2517 transitions. [2021-11-17 12:44:25,329 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2517 transitions. Word has length 127 [2021-11-17 12:44:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:44:25,329 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 2517 transitions. [2021-11-17 12:44:25,329 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-11-17 12:44:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2517 transitions. [2021-11-17 12:44:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-17 12:44:25,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:44:25,331 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:44:25,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 12:44:25,332 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 26 more)] === [2021-11-17 12:44:25,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:44:25,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1975583176, now seen corresponding path program 1 times [2021-11-17 12:44:25,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:44:25,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290524250] [2021-11-17 12:44:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:44:25,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:44:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:44:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:44:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:44:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:44:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:44:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:44:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:44:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:44:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:44:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:44:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:44:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:44:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:44:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:44:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:44:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-17 12:44:25,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:44:25,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290524250] [2021-11-17 12:44:25,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290524250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:44:25,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:44:25,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:44:25,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805582525] [2021-11-17 12:44:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:44:25,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:44:25,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:44:25,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:44:25,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:44:25,799 INFO L87 Difference]: Start difference. First operand 1847 states and 2517 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:44:27,006 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:33,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:38,786 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:40,966 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:43,369 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:45,994 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:44:52,411 INFO L93 Difference]: Finished difference Result 3541 states and 4958 transitions. [2021-11-17 12:44:52,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 12:44:52,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 140 [2021-11-17 12:44:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:44:52,422 INFO L225 Difference]: With dead ends: 3541 [2021-11-17 12:44:52,422 INFO L226 Difference]: Without dead ends: 3539 [2021-11-17 12:44:52,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2021-11-17 12:44:52,424 INFO L933 BasicCegarLoop]: 2027 mSDtfsCounter, 3726 mSDsluCounter, 5166 mSDsCounter, 0 mSdLazyCounter, 4145 mSolverCounterSat, 1860 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3874 SdHoareTripleChecker+Valid, 7193 SdHoareTripleChecker+Invalid, 6010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1860 IncrementalHoareTripleChecker+Valid, 4145 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:44:52,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3874 Valid, 7193 Invalid, 6010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1860 Valid, 4145 Invalid, 5 Unknown, 0 Unchecked, 25.9s Time] [2021-11-17 12:44:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2021-11-17 12:44:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3239. [2021-11-17 12:44:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3239 states, 2347 states have (on average 1.2986791648913507) internal successors, (3048), 2426 states have internal predecessors, (3048), 661 states have call successors, (661), 212 states have call predecessors, (661), 217 states have return successors, (858), 632 states have call predecessors, (858), 659 states have call successors, (858) [2021-11-17 12:44:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4567 transitions. [2021-11-17 12:44:52,590 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4567 transitions. Word has length 140 [2021-11-17 12:44:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:44:52,590 INFO L470 AbstractCegarLoop]: Abstraction has 3239 states and 4567 transitions. [2021-11-17 12:44:52,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 12:44:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4567 transitions. [2021-11-17 12:44:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-17 12:44:52,592 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:44:52,592 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, 1] [2021-11-17 12:44:52,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 12:44:52,593 INFO L402 AbstractCegarLoop]: === Iteration 20 === 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 26 more)] === [2021-11-17 12:44:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:44:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1594898698, now seen corresponding path program 1 times [2021-11-17 12:44:52,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:44:52,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469503906] [2021-11-17 12:44:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:44:52,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:44:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:44:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:44:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:44:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:44:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:44:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:44:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:44:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:44:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:44:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:44:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:44:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:44:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:44:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-17 12:44:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:44:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:44:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-17 12:44:52,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:44:52,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469503906] [2021-11-17 12:44:52,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469503906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:44:52,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:44:52,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:44:52,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595457454] [2021-11-17 12:44:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:44:52,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:44:52,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:44:52,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:44:52,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:44:52,966 INFO L87 Difference]: Start difference. First operand 3239 states and 4567 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:44:54,038 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:44:58,490 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:02,878 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:45:04,676 INFO L93 Difference]: Finished difference Result 6491 states and 9229 transitions. [2021-11-17 12:45:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:45:04,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 172 [2021-11-17 12:45:04,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:45:04,690 INFO L225 Difference]: With dead ends: 6491 [2021-11-17 12:45:04,690 INFO L226 Difference]: Without dead ends: 3347 [2021-11-17 12:45:04,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:45:04,699 INFO L933 BasicCegarLoop]: 1424 mSDtfsCounter, 2637 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 1196 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2810 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1196 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:45:04,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2810 Valid, 2659 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1196 Valid, 963 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2021-11-17 12:45:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2021-11-17 12:45:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3229. [2021-11-17 12:45:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 2338 states have (on average 1.2964071856287425) internal successors, (3031), 2416 states have internal predecessors, (3031), 661 states have call successors, (661), 212 states have call predecessors, (661), 217 states have return successors, (858), 632 states have call predecessors, (858), 659 states have call successors, (858) [2021-11-17 12:45:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4550 transitions. [2021-11-17 12:45:04,850 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4550 transitions. Word has length 172 [2021-11-17 12:45:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:45:04,850 INFO L470 AbstractCegarLoop]: Abstraction has 3229 states and 4550 transitions. [2021-11-17 12:45:04,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:45:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4550 transitions. [2021-11-17 12:45:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-17 12:45:04,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:45:04,854 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:45:04,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 12:45:04,854 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:45:04,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:45:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash 752024843, now seen corresponding path program 1 times [2021-11-17 12:45:04,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:45:04,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32705516] [2021-11-17 12:45:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:45:04,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:45:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:45:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:45:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:45:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:45:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:45:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:45:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:45:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:45:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:45:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:45:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:45:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:45:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:45:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:45:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:45:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:45:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:45:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:45:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:45:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-17 12:45:05,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:45:05,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32705516] [2021-11-17 12:45:05,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32705516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:45:05,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:45:05,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:45:05,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181874995] [2021-11-17 12:45:05,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:45:05,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:45:05,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:45:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:45:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:45:05,204 INFO L87 Difference]: Start difference. First operand 3229 states and 4550 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2021-11-17 12:45:07,228 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:09,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:11,374 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:16,708 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:21,578 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:23,717 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:45:28,422 INFO L93 Difference]: Finished difference Result 5801 states and 8251 transitions. [2021-11-17 12:45:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:45:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2021-11-17 12:45:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:45:28,434 INFO L225 Difference]: With dead ends: 5801 [2021-11-17 12:45:28,434 INFO L226 Difference]: Without dead ends: 3353 [2021-11-17 12:45:28,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-11-17 12:45:28,443 INFO L933 BasicCegarLoop]: 1425 mSDtfsCounter, 1524 mSDsluCounter, 2902 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 1018 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 4327 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:45:28,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 4327 Invalid, 3394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2371 Invalid, 5 Unknown, 0 Unchecked, 22.7s Time] [2021-11-17 12:45:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2021-11-17 12:45:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3233. [2021-11-17 12:45:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 2342 states have (on average 1.2924850555081127) internal successors, (3027), 2420 states have internal predecessors, (3027), 661 states have call successors, (661), 212 states have call predecessors, (661), 217 states have return successors, (858), 632 states have call predecessors, (858), 659 states have call successors, (858) [2021-11-17 12:45:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4546 transitions. [2021-11-17 12:45:28,614 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4546 transitions. Word has length 141 [2021-11-17 12:45:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:45:28,615 INFO L470 AbstractCegarLoop]: Abstraction has 3233 states and 4546 transitions. [2021-11-17 12:45:28,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2021-11-17 12:45:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4546 transitions. [2021-11-17 12:45:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-17 12:45:28,617 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:45:28,617 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:45:28,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-17 12:45:28,617 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:45:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:45:28,618 INFO L85 PathProgramCache]: Analyzing trace with hash -473632468, now seen corresponding path program 1 times [2021-11-17 12:45:28,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:45:28,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883150022] [2021-11-17 12:45:28,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:45:28,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:45:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:45:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:45:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:28,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:45:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:45:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:28,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:45:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:45:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:45:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:45:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:45:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:45:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:45:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:45:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:45:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:45:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:45:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:45:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:45:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:45:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:45:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:45:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-17 12:45:29,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:45:29,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883150022] [2021-11-17 12:45:29,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883150022] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:45:29,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:45:29,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:45:29,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679747210] [2021-11-17 12:45:29,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:45:29,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:45:29,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:45:29,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:45:29,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:45:29,154 INFO L87 Difference]: Start difference. First operand 3233 states and 4546 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2021-11-17 12:45:37,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:43,110 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:45,260 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:47,800 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:51,570 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:53,740 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:55,900 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:45:58,289 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:46:01,735 INFO L93 Difference]: Finished difference Result 3992 states and 5576 transitions. [2021-11-17 12:46:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:46:01,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2021-11-17 12:46:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:46:01,747 INFO L225 Difference]: With dead ends: 3992 [2021-11-17 12:46:01,747 INFO L226 Difference]: Without dead ends: 3990 [2021-11-17 12:46:01,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-17 12:46:01,749 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 2276 mSDsluCounter, 3915 mSDsCounter, 0 mSdLazyCounter, 3735 mSolverCounterSat, 1316 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 5639 SdHoareTripleChecker+Invalid, 5059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1316 IncrementalHoareTripleChecker+Valid, 3735 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:46:01,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2326 Valid, 5639 Invalid, 5059 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1316 Valid, 3735 Invalid, 8 Unknown, 0 Unchecked, 31.8s Time] [2021-11-17 12:46:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2021-11-17 12:46:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3819. [2021-11-17 12:46:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 2777 states have (on average 1.284119553474973) internal successors, (3566), 2864 states have internal predecessors, (3566), 757 states have call successors, (757), 270 states have call predecessors, (757), 272 states have return successors, (1002), 716 states have call predecessors, (1002), 755 states have call successors, (1002) [2021-11-17 12:46:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 5325 transitions. [2021-11-17 12:46:01,955 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 5325 transitions. Word has length 141 [2021-11-17 12:46:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:46:01,956 INFO L470 AbstractCegarLoop]: Abstraction has 3819 states and 5325 transitions. [2021-11-17 12:46:01,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2021-11-17 12:46:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 5325 transitions. [2021-11-17 12:46:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-17 12:46:01,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:46:01,958 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:46:01,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-17 12:46:01,958 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:46:01,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:46:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1291280918, now seen corresponding path program 1 times [2021-11-17 12:46:01,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:46:01,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907074343] [2021-11-17 12:46:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:46:01,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:46:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:46:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:46:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:46:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:46:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:46:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:46:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:46:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:46:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:46:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:46:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:46:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:46:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:46:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:46:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:46:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:46:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-17 12:46:02,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:46:02,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907074343] [2021-11-17 12:46:02,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907074343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:46:02,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:46:02,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:46:02,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176903643] [2021-11-17 12:46:02,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:46:02,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:46:02,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:46:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:46:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:46:02,360 INFO L87 Difference]: Start difference. First operand 3819 states and 5325 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2021-11-17 12:46:04,646 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:11,111 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:17,748 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:19,916 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:22,048 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:24,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:46:27,678 INFO L93 Difference]: Finished difference Result 6659 states and 9364 transitions. [2021-11-17 12:46:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 12:46:27,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2021-11-17 12:46:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:46:27,692 INFO L225 Difference]: With dead ends: 6659 [2021-11-17 12:46:27,693 INFO L226 Difference]: Without dead ends: 3679 [2021-11-17 12:46:27,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-11-17 12:46:27,705 INFO L933 BasicCegarLoop]: 1428 mSDtfsCounter, 1510 mSDsluCounter, 3738 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 1006 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 5166 SdHoareTripleChecker+Invalid, 4092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1006 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:46:27,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1510 Valid, 5166 Invalid, 4092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1006 Valid, 3081 Invalid, 5 Unknown, 0 Unchecked, 24.7s Time] [2021-11-17 12:46:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2021-11-17 12:46:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3557. [2021-11-17 12:46:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 2567 states have (on average 1.2691858200233737) internal successors, (3258), 2636 states have internal predecessors, (3258), 707 states have call successors, (707), 254 states have call predecessors, (707), 270 states have return successors, (950), 698 states have call predecessors, (950), 705 states have call successors, (950) [2021-11-17 12:46:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4915 transitions. [2021-11-17 12:46:27,898 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4915 transitions. Word has length 141 [2021-11-17 12:46:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:46:27,898 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4915 transitions. [2021-11-17 12:46:27,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2021-11-17 12:46:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4915 transitions. [2021-11-17 12:46:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-17 12:46:27,900 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:46:27,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, 1, 1, 1, 1, 1, 1] [2021-11-17 12:46:27,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-17 12:46:27,901 INFO L402 AbstractCegarLoop]: === Iteration 24 === 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 26 more)] === [2021-11-17 12:46:27,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:46:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1049515101, now seen corresponding path program 1 times [2021-11-17 12:46:27,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:46:27,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368223970] [2021-11-17 12:46:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:46:27,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:46:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:46:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:46:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:46:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:46:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:46:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:46:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:46:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:46:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:46:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:46:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:46:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:46:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:46:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:46:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:46:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:46:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:46:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:46:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:46:28,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:46:28,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368223970] [2021-11-17 12:46:28,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368223970] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:46:28,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:46:28,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:46:28,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284760556] [2021-11-17 12:46:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:46:28,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:46:28,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:46:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:46:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:46:28,266 INFO L87 Difference]: Start difference. First operand 3557 states and 4915 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-11-17 12:46:30,291 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:46:35,939 INFO L93 Difference]: Finished difference Result 3557 states and 4915 transitions. [2021-11-17 12:46:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:46:35,940 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-11-17 12:46:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:46:35,951 INFO L225 Difference]: With dead ends: 3557 [2021-11-17 12:46:35,952 INFO L226 Difference]: Without dead ends: 3555 [2021-11-17 12:46:35,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:46:35,955 INFO L933 BasicCegarLoop]: 1413 mSDtfsCounter, 2326 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:46:35,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2472 Valid, 3051 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1090 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2021-11-17 12:46:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2021-11-17 12:46:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3555. [2021-11-17 12:46:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 2566 states have (on average 1.2685113016367888) internal successors, (3255), 2634 states have internal predecessors, (3255), 707 states have call successors, (707), 254 states have call predecessors, (707), 270 states have return successors, (950), 698 states have call predecessors, (950), 705 states have call successors, (950) [2021-11-17 12:46:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 4912 transitions. [2021-11-17 12:46:36,175 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 4912 transitions. Word has length 133 [2021-11-17 12:46:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:46:36,176 INFO L470 AbstractCegarLoop]: Abstraction has 3555 states and 4912 transitions. [2021-11-17 12:46:36,176 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-11-17 12:46:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 4912 transitions. [2021-11-17 12:46:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-17 12:46:36,178 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:46:36,178 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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-11-17 12:46:36,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-17 12:46:36,178 INFO L402 AbstractCegarLoop]: === Iteration 25 === 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 26 more)] === [2021-11-17 12:46:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:46:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash -453488512, now seen corresponding path program 1 times [2021-11-17 12:46:36,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:46:36,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218927251] [2021-11-17 12:46:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:46:36,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:46:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:46:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:46:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:46:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:46:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:46:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:46:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:46:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:46:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:46:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:46:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:46:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:46:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:46:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 12:46:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-17 12:46:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 12:46:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:46:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 12:46:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-11-17 12:46:36,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:46:36,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218927251] [2021-11-17 12:46:36,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218927251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:46:36,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:46:36,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:46:36,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409946207] [2021-11-17 12:46:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:46:36,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:46:36,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:46:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:46:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:46:36,689 INFO L87 Difference]: Start difference. First operand 3555 states and 4912 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:46:38,287 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:44,519 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:50,531 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:52,652 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:54,785 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:56,910 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:46:59,922 INFO L93 Difference]: Finished difference Result 5049 states and 6934 transitions. [2021-11-17 12:46:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:46:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2021-11-17 12:46:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:46:59,929 INFO L225 Difference]: With dead ends: 5049 [2021-11-17 12:46:59,929 INFO L226 Difference]: Without dead ends: 2333 [2021-11-17 12:46:59,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-11-17 12:46:59,938 INFO L933 BasicCegarLoop]: 1404 mSDtfsCounter, 1943 mSDsluCounter, 3745 mSDsCounter, 0 mSdLazyCounter, 3020 mSolverCounterSat, 1313 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 5149 SdHoareTripleChecker+Invalid, 4338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1313 IncrementalHoareTripleChecker+Valid, 3020 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:46:59,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1943 Valid, 5149 Invalid, 4338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1313 Valid, 3020 Invalid, 5 Unknown, 0 Unchecked, 22.6s Time] [2021-11-17 12:46:59,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2021-11-17 12:47:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2253. [2021-11-17 12:47:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 1613 states have (on average 1.2721636701797892) internal successors, (2052), 1670 states have internal predecessors, (2052), 473 states have call successors, (473), 149 states have call predecessors, (473), 155 states have return successors, (552), 463 states have call predecessors, (552), 471 states have call successors, (552) [2021-11-17 12:47:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3077 transitions. [2021-11-17 12:47:00,050 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3077 transitions. Word has length 155 [2021-11-17 12:47:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:00,050 INFO L470 AbstractCegarLoop]: Abstraction has 2253 states and 3077 transitions. [2021-11-17 12:47:00,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:47:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3077 transitions. [2021-11-17 12:47:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-17 12:47:00,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:00,052 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-11-17 12:47:00,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-17 12:47:00,052 INFO L402 AbstractCegarLoop]: === Iteration 26 === 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 26 more)] === [2021-11-17 12:47:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1991301579, now seen corresponding path program 1 times [2021-11-17 12:47:00,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:00,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250799410] [2021-11-17 12:47:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:00,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:47:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:47:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:47:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:47:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:47:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:47:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:47:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:47:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:47:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:47:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:47:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:47:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:47:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:47:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:47:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:47:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:47:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:47:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:47:00,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:00,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250799410] [2021-11-17 12:47:00,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250799410] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:00,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:00,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:00,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753156459] [2021-11-17 12:47:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:00,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:00,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:00,460 INFO L87 Difference]: Start difference. First operand 2253 states and 3077 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-11-17 12:47:03,167 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:07,692 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:10,940 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:12,548 INFO L93 Difference]: Finished difference Result 2253 states and 3077 transitions. [2021-11-17 12:47:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:12,549 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-11-17 12:47:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:12,554 INFO L225 Difference]: With dead ends: 2253 [2021-11-17 12:47:12,554 INFO L226 Difference]: Without dead ends: 2251 [2021-11-17 12:47:12,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:12,555 INFO L933 BasicCegarLoop]: 1411 mSDtfsCounter, 2320 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2465 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:12,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2465 Valid, 3049 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1087 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2021-11-17 12:47:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2021-11-17 12:47:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2251. [2021-11-17 12:47:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 1612 states have (on average 1.271712158808933) internal successors, (2050), 1668 states have internal predecessors, (2050), 473 states have call successors, (473), 149 states have call predecessors, (473), 155 states have return successors, (552), 463 states have call predecessors, (552), 471 states have call successors, (552) [2021-11-17 12:47:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3075 transitions. [2021-11-17 12:47:12,654 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3075 transitions. Word has length 139 [2021-11-17 12:47:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:12,654 INFO L470 AbstractCegarLoop]: Abstraction has 2251 states and 3075 transitions. [2021-11-17 12:47:12,654 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-11-17 12:47:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3075 transitions. [2021-11-17 12:47:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-17 12:47:12,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:12,656 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-11-17 12:47:12,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-17 12:47:12,656 INFO L402 AbstractCegarLoop]: === Iteration 27 === 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 26 more)] === [2021-11-17 12:47:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash 612589949, now seen corresponding path program 1 times [2021-11-17 12:47:12,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:12,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190469255] [2021-11-17 12:47:12,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:12,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:47:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:47:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:47:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:47:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:47:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:47:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:47:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:47:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:47:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:47:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:47:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:47:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:47:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:47:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:47:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:47:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:47:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:47:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:47:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:47:12,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:12,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190469255] [2021-11-17 12:47:12,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190469255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:12,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:12,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:12,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961675560] [2021-11-17 12:47:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:12,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:12,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:12,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:12,971 INFO L87 Difference]: Start difference. First operand 2251 states and 3075 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-11-17 12:47:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:18,158 INFO L93 Difference]: Finished difference Result 2251 states and 3075 transitions. [2021-11-17 12:47:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:18,159 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-11-17 12:47:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:18,165 INFO L225 Difference]: With dead ends: 2251 [2021-11-17 12:47:18,165 INFO L226 Difference]: Without dead ends: 2249 [2021-11-17 12:47:18,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:18,166 INFO L933 BasicCegarLoop]: 1409 mSDtfsCounter, 2314 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 3047 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:18,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2458 Valid, 3047 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2021-11-17 12:47:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2021-11-17 12:47:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2249. [2021-11-17 12:47:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 1611 states have (on average 1.271260086902545) internal successors, (2048), 1666 states have internal predecessors, (2048), 473 states have call successors, (473), 149 states have call predecessors, (473), 155 states have return successors, (552), 463 states have call predecessors, (552), 471 states have call successors, (552) [2021-11-17 12:47:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3073 transitions. [2021-11-17 12:47:18,265 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3073 transitions. Word has length 145 [2021-11-17 12:47:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:18,265 INFO L470 AbstractCegarLoop]: Abstraction has 2249 states and 3073 transitions. [2021-11-17 12:47:18,265 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-11-17 12:47:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3073 transitions. [2021-11-17 12:47:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-17 12:47:18,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:18,267 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, 1, 1, 1, 1, 1, 1] [2021-11-17 12:47:18,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-17 12:47:18,268 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:47:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1635630354, now seen corresponding path program 1 times [2021-11-17 12:47:18,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:18,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605580542] [2021-11-17 12:47:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:18,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:47:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:47:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:47:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:47:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:47:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:47:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:47:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:47:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:47:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:47:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:47:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:47:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:47:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:47:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:47:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:47:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:47:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:47:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:47:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:47:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:47:18,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:18,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605580542] [2021-11-17 12:47:18,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605580542] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:18,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:18,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:18,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082635301] [2021-11-17 12:47:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:18,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:18,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:18,651 INFO L87 Difference]: Start difference. First operand 2249 states and 3073 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:47:19,706 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:25,092 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:26,784 INFO L93 Difference]: Finished difference Result 2249 states and 3073 transitions. [2021-11-17 12:47:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:26,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2021-11-17 12:47:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:26,791 INFO L225 Difference]: With dead ends: 2249 [2021-11-17 12:47:26,791 INFO L226 Difference]: Without dead ends: 2247 [2021-11-17 12:47:26,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:26,793 INFO L933 BasicCegarLoop]: 1407 mSDtfsCounter, 2308 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2451 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:26,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2451 Valid, 3045 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1084 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2021-11-17 12:47:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2021-11-17 12:47:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2247. [2021-11-17 12:47:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 1610 states have (on average 1.270807453416149) internal successors, (2046), 1664 states have internal predecessors, (2046), 473 states have call successors, (473), 149 states have call predecessors, (473), 155 states have return successors, (552), 463 states have call predecessors, (552), 471 states have call successors, (552) [2021-11-17 12:47:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3071 transitions. [2021-11-17 12:47:26,912 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3071 transitions. Word has length 151 [2021-11-17 12:47:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:26,912 INFO L470 AbstractCegarLoop]: Abstraction has 2247 states and 3071 transitions. [2021-11-17 12:47:26,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:47:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3071 transitions. [2021-11-17 12:47:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-17 12:47:26,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:26,915 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:47:26,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-17 12:47:26,916 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:47:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2143027558, now seen corresponding path program 1 times [2021-11-17 12:47:26,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:26,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358502900] [2021-11-17 12:47:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:26,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:47:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:47:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:47:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:47:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:47:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:47:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:47:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:47:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:47:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:47:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:47:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:47:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:47:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:47:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:47:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 12:47:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:47:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:47:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 12:47:27,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:27,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358502900] [2021-11-17 12:47:27,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358502900] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:27,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:27,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:47:27,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761127728] [2021-11-17 12:47:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:27,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:47:27,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:47:27,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:47:27,512 INFO L87 Difference]: Start difference. First operand 2247 states and 3071 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:47:36,350 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:40,928 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:46,984 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:49,110 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:51,234 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:53,386 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:56,084 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:58,235 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:00,387 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:48:05,312 INFO L93 Difference]: Finished difference Result 2507 states and 3404 transitions. [2021-11-17 12:48:05,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:48:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 164 [2021-11-17 12:48:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:48:05,318 INFO L225 Difference]: With dead ends: 2507 [2021-11-17 12:48:05,318 INFO L226 Difference]: Without dead ends: 2505 [2021-11-17 12:48:05,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-17 12:48:05,327 INFO L933 BasicCegarLoop]: 2201 mSDtfsCounter, 2745 mSDsluCounter, 4804 mSDsCounter, 0 mSdLazyCounter, 4883 mSolverCounterSat, 1731 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2870 SdHoareTripleChecker+Valid, 7005 SdHoareTripleChecker+Invalid, 6623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1731 IncrementalHoareTripleChecker+Valid, 4883 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:48:05,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2870 Valid, 7005 Invalid, 6623 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1731 Valid, 4883 Invalid, 9 Unknown, 0 Unchecked, 37.0s Time] [2021-11-17 12:48:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2021-11-17 12:48:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2277. [2021-11-17 12:48:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 1627 states have (on average 1.2679778733866012) internal successors, (2063), 1689 states have internal predecessors, (2063), 484 states have call successors, (484), 153 states have call predecessors, (484), 157 states have return successors, (563), 464 states have call predecessors, (563), 482 states have call successors, (563) [2021-11-17 12:48:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3110 transitions. [2021-11-17 12:48:05,449 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3110 transitions. Word has length 164 [2021-11-17 12:48:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:48:05,449 INFO L470 AbstractCegarLoop]: Abstraction has 2277 states and 3110 transitions. [2021-11-17 12:48:05,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:48:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3110 transitions. [2021-11-17 12:48:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-17 12:48:05,452 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:48:05,452 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:48:05,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-17 12:48:05,452 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:48:05,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:48:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash 148882852, now seen corresponding path program 1 times [2021-11-17 12:48:05,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:48:05,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189709194] [2021-11-17 12:48:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:48:05,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:48:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:48:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:48:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:48:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:48:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:48:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:48:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:48:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:48:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:48:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:48:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:48:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:48:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:48:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:48:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:48:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:48:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:48:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 12:48:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:48:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:48:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 12:48:05,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:48:05,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189709194] [2021-11-17 12:48:05,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189709194] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:48:05,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:48:05,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:48:05,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191076513] [2021-11-17 12:48:05,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:48:05,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:48:05,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:48:05,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:48:05,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:48:05,911 INFO L87 Difference]: Start difference. First operand 2277 states and 3110 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:48:07,322 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:13,717 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:17,202 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:23,155 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:25,282 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:27,421 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:48:31,197 INFO L93 Difference]: Finished difference Result 4303 states and 6032 transitions. [2021-11-17 12:48:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 12:48:31,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 164 [2021-11-17 12:48:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:48:31,204 INFO L225 Difference]: With dead ends: 4303 [2021-11-17 12:48:31,204 INFO L226 Difference]: Without dead ends: 2305 [2021-11-17 12:48:31,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-17 12:48:31,210 INFO L933 BasicCegarLoop]: 1429 mSDtfsCounter, 1486 mSDsluCounter, 3774 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 1003 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 5203 SdHoareTripleChecker+Invalid, 4094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:48:31,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 5203 Invalid, 4094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 3086 Invalid, 5 Unknown, 0 Unchecked, 24.7s Time] [2021-11-17 12:48:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2021-11-17 12:48:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2245. [2021-11-17 12:48:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1607 states have (on average 1.2644679527069074) internal successors, (2032), 1665 states have internal predecessors, (2032), 471 states have call successors, (471), 149 states have call predecessors, (471), 158 states have return successors, (573), 460 states have call predecessors, (573), 469 states have call successors, (573) [2021-11-17 12:48:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3076 transitions. [2021-11-17 12:48:31,315 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3076 transitions. Word has length 164 [2021-11-17 12:48:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:48:31,316 INFO L470 AbstractCegarLoop]: Abstraction has 2245 states and 3076 transitions. [2021-11-17 12:48:31,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:48:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3076 transitions. [2021-11-17 12:48:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-17 12:48:31,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:48:31,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:48:31,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-17 12:48:31,319 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:48:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:48:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1417331117, now seen corresponding path program 1 times [2021-11-17 12:48:31,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:48:31,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818976021] [2021-11-17 12:48:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:48:31,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:48:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:48:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:48:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:48:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:48:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:48:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:48:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:48:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:48:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:48:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:48:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:48:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:48:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:48:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:48:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:48:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:48:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:48:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:48:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:48:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:48:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:48:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:48:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:48:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:48:31,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:48:31,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818976021] [2021-11-17 12:48:31,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818976021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:48:31,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:48:31,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:48:31,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374855688] [2021-11-17 12:48:31,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:48:31,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:48:31,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:48:31,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:48:31,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:48:31,710 INFO L87 Difference]: Start difference. First operand 2245 states and 3076 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 12:48:33,735 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:39,151 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:48:40,767 INFO L93 Difference]: Finished difference Result 2245 states and 3076 transitions. [2021-11-17 12:48:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:48:40,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2021-11-17 12:48:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:48:40,774 INFO L225 Difference]: With dead ends: 2245 [2021-11-17 12:48:40,774 INFO L226 Difference]: Without dead ends: 2243 [2021-11-17 12:48:40,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:48:40,775 INFO L933 BasicCegarLoop]: 1405 mSDtfsCounter, 2302 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2444 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:48:40,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2444 Valid, 3043 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1081 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2021-11-17 12:48:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2021-11-17 12:48:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2243. [2021-11-17 12:48:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2243 states, 1606 states have (on average 1.2640099626400996) internal successors, (2030), 1663 states have internal predecessors, (2030), 471 states have call successors, (471), 149 states have call predecessors, (471), 158 states have return successors, (573), 460 states have call predecessors, (573), 469 states have call successors, (573) [2021-11-17 12:48:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3074 transitions. [2021-11-17 12:48:40,912 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3074 transitions. Word has length 157 [2021-11-17 12:48:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:48:40,912 INFO L470 AbstractCegarLoop]: Abstraction has 2243 states and 3074 transitions. [2021-11-17 12:48:40,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 12:48:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3074 transitions. [2021-11-17 12:48:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 12:48:40,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:48:40,914 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:48:40,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-17 12:48:40,915 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:48:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:48:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1379332131, now seen corresponding path program 1 times [2021-11-17 12:48:40,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:48:40,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227558270] [2021-11-17 12:48:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:48:40,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:48:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:48:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:48:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:48:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:48:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:48:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:48:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:48:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:48:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:48:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:48:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:48:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:48:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:48:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:48:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:48:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:48:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:48:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:48:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:48:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:48:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 12:48:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 12:48:41,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:48:41,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227558270] [2021-11-17 12:48:41,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227558270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:48:41,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:48:41,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 12:48:41,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871429490] [2021-11-17 12:48:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:48:41,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 12:48:41,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:48:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 12:48:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:48:41,494 INFO L87 Difference]: Start difference. First operand 2243 states and 3074 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (28), 7 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:48:43,518 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:45,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:52,118 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:59,601 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:03,455 INFO L93 Difference]: Finished difference Result 3779 states and 5215 transitions. [2021-11-17 12:49:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 12:49:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (28), 7 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 169 [2021-11-17 12:49:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:03,463 INFO L225 Difference]: With dead ends: 3779 [2021-11-17 12:49:03,463 INFO L226 Difference]: Without dead ends: 2368 [2021-11-17 12:49:03,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-11-17 12:49:03,466 INFO L933 BasicCegarLoop]: 1394 mSDtfsCounter, 1828 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 3733 mSolverCounterSat, 1337 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 5493 SdHoareTripleChecker+Invalid, 5073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1337 IncrementalHoareTripleChecker+Valid, 3733 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:03,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1828 Valid, 5493 Invalid, 5073 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1337 Valid, 3733 Invalid, 3 Unknown, 0 Unchecked, 21.2s Time] [2021-11-17 12:49:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2021-11-17 12:49:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2253. [2021-11-17 12:49:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 1615 states have (on average 1.2625386996904024) internal successors, (2039), 1669 states have internal predecessors, (2039), 471 states have call successors, (471), 149 states have call predecessors, (471), 159 states have return successors, (592), 464 states have call predecessors, (592), 469 states have call successors, (592) [2021-11-17 12:49:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3102 transitions. [2021-11-17 12:49:03,612 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3102 transitions. Word has length 169 [2021-11-17 12:49:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:03,612 INFO L470 AbstractCegarLoop]: Abstraction has 2253 states and 3102 transitions. [2021-11-17 12:49:03,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (28), 7 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 12:49:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3102 transitions. [2021-11-17 12:49:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 12:49:03,614 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:03,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:49:03,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-17 12:49:03,615 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:49:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:03,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1630561764, now seen corresponding path program 1 times [2021-11-17 12:49:03,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:03,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722142915] [2021-11-17 12:49:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:03,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:49:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:49:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:49:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:49:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:49:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:49:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:49:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:49:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:49:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:49:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:49:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:49:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:49:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:49:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:49:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:49:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:49:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:49:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:49:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:49:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:49:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:49:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:49:04,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:04,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722142915] [2021-11-17 12:49:04,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722142915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:04,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:04,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:49:04,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483369563] [2021-11-17 12:49:04,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:04,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:49:04,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:04,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:49:04,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:49:04,006 INFO L87 Difference]: Start difference. First operand 2253 states and 3102 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:49:05,729 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:11,032 INFO L93 Difference]: Finished difference Result 2253 states and 3102 transitions. [2021-11-17 12:49:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:49:11,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2021-11-17 12:49:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:11,038 INFO L225 Difference]: With dead ends: 2253 [2021-11-17 12:49:11,038 INFO L226 Difference]: Without dead ends: 2251 [2021-11-17 12:49:11,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:49:11,039 INFO L933 BasicCegarLoop]: 1403 mSDtfsCounter, 2296 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2437 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:11,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2437 Valid, 3041 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2021-11-17 12:49:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2021-11-17 12:49:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2251. [2021-11-17 12:49:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 1614 states have (on average 1.262081784386617) internal successors, (2037), 1667 states have internal predecessors, (2037), 471 states have call successors, (471), 149 states have call predecessors, (471), 159 states have return successors, (592), 464 states have call predecessors, (592), 469 states have call successors, (592) [2021-11-17 12:49:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3100 transitions. [2021-11-17 12:49:11,161 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3100 transitions. Word has length 163 [2021-11-17 12:49:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:11,161 INFO L470 AbstractCegarLoop]: Abstraction has 2251 states and 3100 transitions. [2021-11-17 12:49:11,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:49:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3100 transitions. [2021-11-17 12:49:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 12:49:11,163 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:11,163 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, 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-11-17 12:49:11,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-17 12:49:11,164 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:49:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1463111287, now seen corresponding path program 1 times [2021-11-17 12:49:11,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:11,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173676068] [2021-11-17 12:49:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:11,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:49:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:49:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:49:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:49:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:49:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:49:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:49:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:49:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:49:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:49:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:49:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:49:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:49:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:49:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:49:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:49:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:49:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:49:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:49:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:49:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:49:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:49:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:49:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:49:11,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:11,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173676068] [2021-11-17 12:49:11,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173676068] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:11,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:11,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:49:11,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206461032] [2021-11-17 12:49:11,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:11,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:49:11,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:11,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:49:11,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:49:11,576 INFO L87 Difference]: Start difference. First operand 2251 states and 3100 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:49:13,603 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:19,671 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:21,370 INFO L93 Difference]: Finished difference Result 2251 states and 3100 transitions. [2021-11-17 12:49:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:49:21,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2021-11-17 12:49:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:21,377 INFO L225 Difference]: With dead ends: 2251 [2021-11-17 12:49:21,377 INFO L226 Difference]: Without dead ends: 2249 [2021-11-17 12:49:21,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:49:21,378 INFO L933 BasicCegarLoop]: 1401 mSDtfsCounter, 2290 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2430 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:21,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2430 Valid, 3039 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1077 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2021-11-17 12:49:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2021-11-17 12:49:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2249. [2021-11-17 12:49:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 1613 states have (on average 1.2616243025418474) internal successors, (2035), 1665 states have internal predecessors, (2035), 471 states have call successors, (471), 149 states have call predecessors, (471), 159 states have return successors, (592), 464 states have call predecessors, (592), 469 states have call successors, (592) [2021-11-17 12:49:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3098 transitions. [2021-11-17 12:49:21,495 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3098 transitions. Word has length 169 [2021-11-17 12:49:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:21,495 INFO L470 AbstractCegarLoop]: Abstraction has 2249 states and 3098 transitions. [2021-11-17 12:49:21,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:49:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3098 transitions. [2021-11-17 12:49:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 12:49:21,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:21,498 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, 1, 1, 1, 1, 1, 1, 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-11-17 12:49:21,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-17 12:49:21,499 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:49:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash 468693408, now seen corresponding path program 1 times [2021-11-17 12:49:21,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:21,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774402171] [2021-11-17 12:49:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:21,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:49:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:49:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:49:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:49:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:49:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:49:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:49:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:49:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:49:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:49:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:49:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:49:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:49:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:49:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:49:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:49:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:49:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:49:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:49:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:49:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:49:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:49:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:49:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 12:49:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:49:21,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:21,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774402171] [2021-11-17 12:49:21,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774402171] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:21,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:21,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:49:21,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352903937] [2021-11-17 12:49:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:21,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:49:21,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:21,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:49:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:49:21,928 INFO L87 Difference]: Start difference. First operand 2249 states and 3098 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 12:49:23,954 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:26,029 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:31,376 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:32,794 INFO L93 Difference]: Finished difference Result 2249 states and 3098 transitions. [2021-11-17 12:49:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:49:32,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2021-11-17 12:49:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:32,800 INFO L225 Difference]: With dead ends: 2249 [2021-11-17 12:49:32,800 INFO L226 Difference]: Without dead ends: 2247 [2021-11-17 12:49:32,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:49:32,809 INFO L933 BasicCegarLoop]: 1399 mSDtfsCounter, 2284 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 836 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:32,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2423 Valid, 3037 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1074 Invalid, 3 Unknown, 0 Unchecked, 10.6s Time] [2021-11-17 12:49:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2021-11-17 12:49:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2247. [2021-11-17 12:49:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 1612 states have (on average 1.261166253101737) internal successors, (2033), 1663 states have internal predecessors, (2033), 471 states have call successors, (471), 149 states have call predecessors, (471), 159 states have return successors, (592), 464 states have call predecessors, (592), 469 states have call successors, (592) [2021-11-17 12:49:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3096 transitions. [2021-11-17 12:49:32,916 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3096 transitions. Word has length 175 [2021-11-17 12:49:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:32,916 INFO L470 AbstractCegarLoop]: Abstraction has 2247 states and 3096 transitions. [2021-11-17 12:49:32,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 12:49:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3096 transitions. [2021-11-17 12:49:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-11-17 12:49:32,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:32,919 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:49:32,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-17 12:49:32,919 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:49:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1360777735, now seen corresponding path program 1 times [2021-11-17 12:49:32,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:32,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652629568] [2021-11-17 12:49:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:32,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:49:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:49:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:49:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:49:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:49:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:49:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:49:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:49:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:49:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:49:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:49:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:49:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:49:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:49:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:49:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:49:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:49:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:49:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:49:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:49:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-17 12:49:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 12:49:33,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:33,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652629568] [2021-11-17 12:49:33,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652629568] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:33,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:33,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-17 12:49:33,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754792429] [2021-11-17 12:49:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:33,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 12:49:33,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 12:49:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-17 12:49:33,480 INFO L87 Difference]: Start difference. First operand 2247 states and 3096 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:49:35,503 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:37,955 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:45,683 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:47,807 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:52,131 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:58,688 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:00,820 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:02,981 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:05,337 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:50:10,946 INFO L93 Difference]: Finished difference Result 3947 states and 5482 transitions. [2021-11-17 12:50:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 12:50:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 189 [2021-11-17 12:50:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:50:10,954 INFO L225 Difference]: With dead ends: 3947 [2021-11-17 12:50:10,954 INFO L226 Difference]: Without dead ends: 2532 [2021-11-17 12:50:10,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-11-17 12:50:10,957 INFO L933 BasicCegarLoop]: 1451 mSDtfsCounter, 2386 mSDsluCounter, 4638 mSDsCounter, 0 mSdLazyCounter, 4431 mSolverCounterSat, 1788 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 6089 SdHoareTripleChecker+Invalid, 6227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1788 IncrementalHoareTripleChecker+Valid, 4431 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:50:10,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2386 Valid, 6089 Invalid, 6227 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1788 Valid, 4431 Invalid, 8 Unknown, 0 Unchecked, 36.5s Time] [2021-11-17 12:50:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2021-11-17 12:50:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2409. [2021-11-17 12:50:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 1741 states have (on average 1.2578977599080987) internal successors, (2190), 1781 states have internal predecessors, (2190), 501 states have call successors, (501), 149 states have call predecessors, (501), 162 states have return successors, (651), 510 states have call predecessors, (651), 499 states have call successors, (651) [2021-11-17 12:50:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 3342 transitions. [2021-11-17 12:50:11,129 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 3342 transitions. Word has length 189 [2021-11-17 12:50:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:50:11,129 INFO L470 AbstractCegarLoop]: Abstraction has 2409 states and 3342 transitions. [2021-11-17 12:50:11,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:50:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 3342 transitions. [2021-11-17 12:50:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-17 12:50:11,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:50:11,133 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:50:11,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-17 12:50:11,133 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:50:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:50:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash -904167847, now seen corresponding path program 1 times [2021-11-17 12:50:11,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:50:11,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86995371] [2021-11-17 12:50:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:50:11,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:50:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:50:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:50:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:50:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:50:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:50:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:50:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:50:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:50:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:50:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:50:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:50:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:50:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:50:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:50:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:50:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:50:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:50:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:50:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:50:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:50:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:50:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:50:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 12:50:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 12:50:11,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:50:11,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86995371] [2021-11-17 12:50:11,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86995371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:50:11,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:50:11,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-17 12:50:11,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430644312] [2021-11-17 12:50:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:50:11,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 12:50:11,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:50:11,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 12:50:11,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:50:11,808 INFO L87 Difference]: Start difference. First operand 2409 states and 3342 transitions. Second operand has 12 states, 11 states have (on average 9.181818181818182) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (31), 9 states have call predecessors, (31), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:50:13,109 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:15,197 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:24,755 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:26,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:37,380 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:39,691 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:41,862 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:44,000 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:46,461 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:49,041 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:51,153 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:50:59,347 INFO L93 Difference]: Finished difference Result 4678 states and 6614 transitions. [2021-11-17 12:50:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-17 12:50:59,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.181818181818182) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (31), 9 states have call predecessors, (31), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 188 [2021-11-17 12:50:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:50:59,359 INFO L225 Difference]: With dead ends: 4678 [2021-11-17 12:50:59,360 INFO L226 Difference]: Without dead ends: 2567 [2021-11-17 12:50:59,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2021-11-17 12:50:59,370 INFO L933 BasicCegarLoop]: 1430 mSDtfsCounter, 2147 mSDsluCounter, 5411 mSDsCounter, 0 mSdLazyCounter, 5391 mSolverCounterSat, 1528 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 6929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1528 IncrementalHoareTripleChecker+Valid, 5391 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:50:59,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2147 Valid, 6841 Invalid, 6929 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1528 Valid, 5391 Invalid, 10 Unknown, 0 Unchecked, 46.0s Time] [2021-11-17 12:50:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2021-11-17 12:50:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2428. [2021-11-17 12:50:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 1753 states have (on average 1.2584141471762693) internal successors, (2206), 1795 states have internal predecessors, (2206), 505 states have call successors, (505), 151 states have call predecessors, (505), 165 states have return successors, (657), 513 states have call predecessors, (657), 503 states have call successors, (657) [2021-11-17 12:50:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3368 transitions. [2021-11-17 12:50:59,494 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3368 transitions. Word has length 188 [2021-11-17 12:50:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:50:59,495 INFO L470 AbstractCegarLoop]: Abstraction has 2428 states and 3368 transitions. [2021-11-17 12:50:59,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.181818181818182) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (31), 9 states have call predecessors, (31), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:50:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3368 transitions. [2021-11-17 12:50:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-11-17 12:50:59,497 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:50:59,497 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:50:59,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-17 12:50:59,498 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:50:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:50:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2061011647, now seen corresponding path program 1 times [2021-11-17 12:50:59,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:50:59,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967528860] [2021-11-17 12:50:59,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:50:59,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:50:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:50:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:50:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:50:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:50:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:50:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:50:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:50:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:50:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:50:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:50:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:50:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:50:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:50:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:50:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:50:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:50:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:50:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:51:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:51:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:51:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:51:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:51:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 12:51:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-17 12:51:00,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:51:00,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967528860] [2021-11-17 12:51:00,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967528860] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:51:00,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687913032] [2021-11-17 12:51:00,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:51:00,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:51:00,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:51:00,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:51:00,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 12:51:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 2965 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-17 12:51:01,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:51:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-11-17 12:51:01,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:51:01,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687913032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:51:01,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 12:51:01,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2021-11-17 12:51:01,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347747143] [2021-11-17 12:51:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:51:01,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:51:01,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:51:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:51:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-11-17 12:51:01,759 INFO L87 Difference]: Start difference. First operand 2428 states and 3368 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-17 12:51:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:51:02,067 INFO L93 Difference]: Finished difference Result 4073 states and 5631 transitions. [2021-11-17 12:51:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:51:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 189 [2021-11-17 12:51:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:51:02,088 INFO L225 Difference]: With dead ends: 4073 [2021-11-17 12:51:02,089 INFO L226 Difference]: Without dead ends: 2488 [2021-11-17 12:51:02,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-11-17 12:51:02,092 INFO L933 BasicCegarLoop]: 1504 mSDtfsCounter, 10 mSDsluCounter, 5987 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7491 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:51:02,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 7491 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 12:51:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2021-11-17 12:51:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2428. [2021-11-17 12:51:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 1753 states have (on average 1.2584141471762693) internal successors, (2206), 1795 states have internal predecessors, (2206), 505 states have call successors, (505), 151 states have call predecessors, (505), 165 states have return successors, (657), 513 states have call predecessors, (657), 503 states have call successors, (657) [2021-11-17 12:51:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3368 transitions. [2021-11-17 12:51:02,228 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3368 transitions. Word has length 189 [2021-11-17 12:51:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:51:02,229 INFO L470 AbstractCegarLoop]: Abstraction has 2428 states and 3368 transitions. [2021-11-17 12:51:02,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-17 12:51:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3368 transitions. [2021-11-17 12:51:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 12:51:02,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:51:02,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:51:02,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-17 12:51:02,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-17 12:51:02,448 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:51:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:51:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1621322072, now seen corresponding path program 1 times [2021-11-17 12:51:02,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:51:02,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102835214] [2021-11-17 12:51:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:51:02,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:51:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:51:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:51:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:51:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:51:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:51:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:51:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:51:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:51:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:51:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:51:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:51:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:51:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:51:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:51:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:51:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:51:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:51:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:51:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:51:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:51:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:51:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:51:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:51:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:51:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:51:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 12:51:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 12:51:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:51:02,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:51:02,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102835214] [2021-11-17 12:51:02,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102835214] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:51:02,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:51:02,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:51:02,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291045204] [2021-11-17 12:51:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:51:02,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:51:02,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:51:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:51:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:51:02,889 INFO L87 Difference]: Start difference. First operand 2428 states and 3368 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 12:51:04,352 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:09,432 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:51:10,996 INFO L93 Difference]: Finished difference Result 2428 states and 3368 transitions. [2021-11-17 12:51:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:51:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2021-11-17 12:51:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:51:11,008 INFO L225 Difference]: With dead ends: 2428 [2021-11-17 12:51:11,008 INFO L226 Difference]: Without dead ends: 2426 [2021-11-17 12:51:11,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:51:11,011 INFO L933 BasicCegarLoop]: 1397 mSDtfsCounter, 2278 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 3035 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:51:11,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2416 Valid, 3035 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1074 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2021-11-17 12:51:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2021-11-17 12:51:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2426. [2021-11-17 12:51:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 1752 states have (on average 1.2579908675799087) internal successors, (2204), 1793 states have internal predecessors, (2204), 505 states have call successors, (505), 151 states have call predecessors, (505), 165 states have return successors, (657), 513 states have call predecessors, (657), 503 states have call successors, (657) [2021-11-17 12:51:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3366 transitions. [2021-11-17 12:51:11,165 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3366 transitions. Word has length 181 [2021-11-17 12:51:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:51:11,165 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 3366 transitions. [2021-11-17 12:51:11,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 12:51:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3366 transitions. [2021-11-17 12:51:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-17 12:51:11,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:51:11,168 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:51:11,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-17 12:51:11,168 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:51:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:51:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash -987678208, now seen corresponding path program 1 times [2021-11-17 12:51:11,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:51:11,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041192162] [2021-11-17 12:51:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:51:11,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:51:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:51:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:51:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:51:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:51:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:51:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:51:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:51:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:51:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:51:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:51:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:51:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:51:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:51:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:51:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 12:51:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:51:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:51:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:51:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:51:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:51:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:51:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 12:51:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 12:51:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 12:51:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2021-11-17 12:51:11,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:51:11,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041192162] [2021-11-17 12:51:11,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041192162] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:51:11,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:51:11,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 12:51:11,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278086321] [2021-11-17 12:51:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:51:11,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 12:51:11,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:51:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 12:51:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:51:11,712 INFO L87 Difference]: Start difference. First operand 2426 states and 3366 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2021-11-17 12:51:13,745 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:15,602 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:22,014 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:24,132 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:27,938 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:33,588 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:35,758 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:37,919 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:40,050 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:42,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:51:46,786 INFO L93 Difference]: Finished difference Result 4709 states and 6638 transitions. [2021-11-17 12:51:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 12:51:46,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 197 [2021-11-17 12:51:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:51:46,816 INFO L225 Difference]: With dead ends: 4709 [2021-11-17 12:51:46,816 INFO L226 Difference]: Without dead ends: 2562 [2021-11-17 12:51:46,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2021-11-17 12:51:46,823 INFO L933 BasicCegarLoop]: 1448 mSDtfsCounter, 2148 mSDsluCounter, 3654 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 1547 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 5102 SdHoareTripleChecker+Invalid, 5267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1547 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:51:46,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2148 Valid, 5102 Invalid, 5267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1547 Valid, 3711 Invalid, 9 Unknown, 0 Unchecked, 34.1s Time] [2021-11-17 12:51:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2021-11-17 12:51:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2467. [2021-11-17 12:51:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 1783 states have (on average 1.255187885586091) internal successors, (2238), 1825 states have internal predecessors, (2238), 512 states have call successors, (512), 153 states have call predecessors, (512), 168 states have return successors, (632), 520 states have call predecessors, (632), 510 states have call successors, (632) [2021-11-17 12:51:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3382 transitions. [2021-11-17 12:51:46,966 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3382 transitions. Word has length 197 [2021-11-17 12:51:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:51:46,966 INFO L470 AbstractCegarLoop]: Abstraction has 2467 states and 3382 transitions. [2021-11-17 12:51:46,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2021-11-17 12:51:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3382 transitions. [2021-11-17 12:51:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-17 12:51:46,969 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:51:46,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:51:46,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-17 12:51:46,970 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:51:46,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:51:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash -464578590, now seen corresponding path program 1 times [2021-11-17 12:51:46,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:51:46,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262265092] [2021-11-17 12:51:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:51:46,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:51:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:51:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:51:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:51:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:51:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:51:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 12:51:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 12:51:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 12:51:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 12:51:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 12:51:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 12:51:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 12:51:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 12:51:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:51:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 12:51:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 12:51:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 12:51:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:51:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 12:51:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:51:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:51:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:51:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 12:51:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:51:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:51:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 12:51:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 12:51:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-17 12:51:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 12:51:47,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:51:47,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262265092] [2021-11-17 12:51:47,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262265092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:51:47,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:51:47,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:51:47,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793882715] [2021-11-17 12:51:47,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:51:47,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:51:47,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:51:47,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:51:47,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:51:47,346 INFO L87 Difference]: Start difference. First operand 2467 states and 3382 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 12:51:54,329 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:56,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:51:58,985 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:01,690 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:52:05,184 INFO L93 Difference]: Finished difference Result 4756 states and 6551 transitions. [2021-11-17 12:52:05,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 12:52:05,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2021-11-17 12:52:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:52:05,195 INFO L225 Difference]: With dead ends: 4756 [2021-11-17 12:52:05,195 INFO L226 Difference]: Without dead ends: 4600 [2021-11-17 12:52:05,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-17 12:52:05,197 INFO L933 BasicCegarLoop]: 1957 mSDtfsCounter, 3173 mSDsluCounter, 3276 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 1266 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3306 SdHoareTripleChecker+Valid, 5233 SdHoareTripleChecker+Invalid, 3526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1266 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:52:05,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3306 Valid, 5233 Invalid, 3526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1266 Valid, 2256 Invalid, 4 Unknown, 0 Unchecked, 17.3s Time] [2021-11-17 12:52:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2021-11-17 12:52:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 4588. [2021-11-17 12:52:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4588 states, 3352 states have (on average 1.2649164677804297) internal successors, (4240), 3425 states have internal predecessors, (4240), 930 states have call successors, (930), 271 states have call predecessors, (930), 302 states have return successors, (1187), 951 states have call predecessors, (1187), 928 states have call successors, (1187) [2021-11-17 12:52:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 6357 transitions. [2021-11-17 12:52:05,501 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 6357 transitions. Word has length 187 [2021-11-17 12:52:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:52:05,501 INFO L470 AbstractCegarLoop]: Abstraction has 4588 states and 6357 transitions. [2021-11-17 12:52:05,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-17 12:52:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 6357 transitions. [2021-11-17 12:52:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2021-11-17 12:52:05,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:52:05,529 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:52:05,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-17 12:52:05,529 INFO L402 AbstractCegarLoop]: === Iteration 42 === 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 26 more)] === [2021-11-17 12:52:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:52:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash -285857616, now seen corresponding path program 1 times [2021-11-17 12:52:05,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:52:05,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584507160] [2021-11-17 12:52:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:52:05,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:52:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:52:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:52:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:52:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:52:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:52:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:52:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:52:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:52:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:52:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:52:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:52:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 12:52:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 12:52:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 12:52:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 12:52:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 12:52:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 12:52:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 12:52:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:05,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-11-17 12:52:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:52:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:52:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:06,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:52:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2021-11-17 12:52:06,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:52:06,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584507160] [2021-11-17 12:52:06,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584507160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:52:06,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:52:06,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-17 12:52:06,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419740343] [2021-11-17 12:52:06,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:52:06,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 12:52:06,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:52:06,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 12:52:06,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-17 12:52:06,121 INFO L87 Difference]: Start difference. First operand 4588 states and 6357 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2021-11-17 12:52:08,147 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:13,962 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:16,033 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:20,843 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:25,855 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:28,017 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:30,151 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:32,276 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:52:38,259 INFO L93 Difference]: Finished difference Result 8818 states and 12352 transitions. [2021-11-17 12:52:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:52:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 248 [2021-11-17 12:52:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:52:38,272 INFO L225 Difference]: With dead ends: 8818 [2021-11-17 12:52:38,272 INFO L226 Difference]: Without dead ends: 4608 [2021-11-17 12:52:38,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-11-17 12:52:38,282 INFO L933 BasicCegarLoop]: 1397 mSDtfsCounter, 1548 mSDsluCounter, 4598 mSDsCounter, 0 mSdLazyCounter, 4228 mSolverCounterSat, 1044 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 5995 SdHoareTripleChecker+Invalid, 5280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1044 IncrementalHoareTripleChecker+Valid, 4228 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:52:38,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1548 Valid, 5995 Invalid, 5280 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1044 Valid, 4228 Invalid, 8 Unknown, 0 Unchecked, 31.3s Time] [2021-11-17 12:52:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2021-11-17 12:52:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4422. [2021-11-17 12:52:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4422 states, 3224 states have (on average 1.2636476426799008) internal successors, (4074), 3295 states have internal predecessors, (4074), 904 states have call successors, (904), 267 states have call predecessors, (904), 290 states have return successors, (1085), 917 states have call predecessors, (1085), 902 states have call successors, (1085) [2021-11-17 12:52:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 6063 transitions. [2021-11-17 12:52:38,543 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 6063 transitions. Word has length 248 [2021-11-17 12:52:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:52:38,544 INFO L470 AbstractCegarLoop]: Abstraction has 4422 states and 6063 transitions. [2021-11-17 12:52:38,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2021-11-17 12:52:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 6063 transitions. [2021-11-17 12:52:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2021-11-17 12:52:38,548 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:52:38,548 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:52:38,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-17 12:52:38,548 INFO L402 AbstractCegarLoop]: === Iteration 43 === 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 26 more)] === [2021-11-17 12:52:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:52:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1736668968, now seen corresponding path program 1 times [2021-11-17 12:52:38,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:52:38,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560916562] [2021-11-17 12:52:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:52:38,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:52:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:52:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:52:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:52:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:52:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:52:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:52:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:52:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:52:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:52:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:52:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:52:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:52:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:52:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 12:52:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 12:52:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 12:52:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 12:52:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 12:52:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 12:52:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:38,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 12:52:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-11-17 12:52:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:52:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:52:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 12:52:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:52:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:52:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:52:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:52:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:52:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 12:52:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:52:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:52:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-17 12:52:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:52:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2021-11-17 12:52:39,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:52:39,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560916562] [2021-11-17 12:52:39,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560916562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:52:39,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:52:39,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-17 12:52:39,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923210993] [2021-11-17 12:52:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:52:39,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 12:52:39,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:52:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 12:52:39,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:52:39,387 INFO L87 Difference]: Start difference. First operand 4422 states and 6063 transitions. Second operand has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (39), 9 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2021-11-17 12:52:41,410 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:44,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:50,286 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:57,043 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:52:59,207 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:01,371 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:03,536 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:07,142 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:09,425 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:53:13,716 INFO L93 Difference]: Finished difference Result 7574 states and 10403 transitions. [2021-11-17 12:53:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 12:53:13,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (39), 9 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) Word has length 335 [2021-11-17 12:53:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:53:13,729 INFO L225 Difference]: With dead ends: 7574 [2021-11-17 12:53:13,729 INFO L226 Difference]: Without dead ends: 4540 [2021-11-17 12:53:13,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-11-17 12:53:13,747 INFO L933 BasicCegarLoop]: 1400 mSDtfsCounter, 2318 mSDsluCounter, 4642 mSDsCounter, 0 mSdLazyCounter, 4065 mSolverCounterSat, 1731 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 6042 SdHoareTripleChecker+Invalid, 5805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1731 IncrementalHoareTripleChecker+Valid, 4065 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:53:13,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2318 Valid, 6042 Invalid, 5805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1731 Valid, 4065 Invalid, 9 Unknown, 0 Unchecked, 33.4s Time] [2021-11-17 12:53:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2021-11-17 12:53:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 4156. [2021-11-17 12:53:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 3028 states have (on average 1.2675033025099076) internal successors, (3838), 3098 states have internal predecessors, (3838), 848 states have call successors, (848), 266 states have call predecessors, (848), 276 states have return successors, (943), 848 states have call predecessors, (943), 846 states have call successors, (943) [2021-11-17 12:53:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 5629 transitions. [2021-11-17 12:53:14,005 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 5629 transitions. Word has length 335 [2021-11-17 12:53:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:53:14,007 INFO L470 AbstractCegarLoop]: Abstraction has 4156 states and 5629 transitions. [2021-11-17 12:53:14,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (39), 9 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2021-11-17 12:53:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 5629 transitions. [2021-11-17 12:53:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-11-17 12:53:14,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:53:14,010 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:53:14,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-17 12:53:14,010 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ttusb_free_iso_urbsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:53:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:53:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -871690169, now seen corresponding path program 1 times [2021-11-17 12:53:14,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:53:14,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036485483] [2021-11-17 12:53:14,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:53:14,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:53:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:53:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:53:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:53:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:53:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:53:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:53:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:53:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:53:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:53:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:53:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:53:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 12:53:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 12:53:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 12:53:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 12:53:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 12:53:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 12:53:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 12:53:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 12:53:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-17 12:53:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-17 12:53:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-11-17 12:53:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-17 12:53:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-11-17 12:53:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-17 12:53:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-11-17 12:53:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2021-11-17 12:53:14,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:53:14,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036485483] [2021-11-17 12:53:14,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036485483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:53:14,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:53:14,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:53:14,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137925014] [2021-11-17 12:53:14,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:53:14,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:53:14,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:53:14,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:53:14,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:53:14,558 INFO L87 Difference]: Start difference. First operand 4156 states and 5629 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 12:53:17,906 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:19,932 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:25,151 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:27,922 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:30,061 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:53:35,929 INFO L93 Difference]: Finished difference Result 6940 states and 9398 transitions. [2021-11-17 12:53:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 12:53:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 264 [2021-11-17 12:53:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:53:35,942 INFO L225 Difference]: With dead ends: 6940 [2021-11-17 12:53:35,942 INFO L226 Difference]: Without dead ends: 4348 [2021-11-17 12:53:35,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-11-17 12:53:35,947 INFO L933 BasicCegarLoop]: 1379 mSDtfsCounter, 1838 mSDsluCounter, 2410 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 1334 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 3789 SdHoareTripleChecker+Invalid, 3675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1334 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:53:35,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1838 Valid, 3789 Invalid, 3675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1334 Valid, 2336 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2021-11-17 12:53:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2021-11-17 12:53:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 4160. [2021-11-17 12:53:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4160 states, 3032 states have (on average 1.267150395778364) internal successors, (3842), 3102 states have internal predecessors, (3842), 848 states have call successors, (848), 266 states have call predecessors, (848), 276 states have return successors, (943), 848 states have call predecessors, (943), 846 states have call successors, (943) [2021-11-17 12:53:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 5633 transitions. [2021-11-17 12:53:36,254 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 5633 transitions. Word has length 264 [2021-11-17 12:53:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:53:36,255 INFO L470 AbstractCegarLoop]: Abstraction has 4160 states and 5633 transitions. [2021-11-17 12:53:36,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 12:53:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 5633 transitions. [2021-11-17 12:53:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-11-17 12:53:36,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:53:36,258 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:53:36,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-17 12:53:36,258 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ttusb_free_iso_urbsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:53:36,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:53:36,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1067828818, now seen corresponding path program 1 times [2021-11-17 12:53:36,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:53:36,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476897994] [2021-11-17 12:53:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:53:36,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:53:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:53:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:53:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:53:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:53:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:53:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:53:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:53:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:53:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:53:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:53:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:53:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:53:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:53:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 12:53:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 12:53:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 12:53:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 12:53:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 12:53:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 12:53:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 12:53:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 12:53:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-17 12:53:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:53:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-17 12:53:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-11-17 12:53:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-11-17 12:53:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-17 12:53:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-11-17 12:53:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-17 12:53:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2021-11-17 12:53:36,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:53:36,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476897994] [2021-11-17 12:53:36,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476897994] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:53:36,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398507630] [2021-11-17 12:53:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:53:36,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:53:36,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:53:36,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:53:36,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-17 12:53:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:53:37,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 3111 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 12:53:37,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:53:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2021-11-17 12:53:37,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 12:53:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2021-11-17 12:53:38,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398507630] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 12:53:38,384 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 12:53:38,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 12 [2021-11-17 12:53:38,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102039358] [2021-11-17 12:53:38,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 12:53:38,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 12:53:38,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:53:38,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 12:53:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:53:38,386 INFO L87 Difference]: Start difference. First operand 4160 states and 5633 transitions. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 2 states have call successors, (52), 8 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2021-11-17 12:53:40,410 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:42,500 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:45,803 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:47,824 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:49,835 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:53:56,245 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:54:03,226 INFO L93 Difference]: Finished difference Result 6972 states and 9438 transitions. [2021-11-17 12:54:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:54:03,227 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 2 states have call successors, (52), 8 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 267 [2021-11-17 12:54:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:54:03,246 INFO L225 Difference]: With dead ends: 6972 [2021-11-17 12:54:03,246 INFO L226 Difference]: Without dead ends: 4376 [2021-11-17 12:54:03,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2021-11-17 12:54:03,252 INFO L933 BasicCegarLoop]: 1380 mSDtfsCounter, 1597 mSDsluCounter, 2740 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 1081 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 4120 SdHoareTripleChecker+Invalid, 4016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 2929 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:54:03,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1597 Valid, 4120 Invalid, 4016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1081 Valid, 2929 Invalid, 6 Unknown, 0 Unchecked, 23.9s Time] [2021-11-17 12:54:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2021-11-17 12:54:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 4196. [2021-11-17 12:54:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 3068 states have (on average 1.2640156453715776) internal successors, (3878), 3138 states have internal predecessors, (3878), 848 states have call successors, (848), 266 states have call predecessors, (848), 276 states have return successors, (943), 848 states have call predecessors, (943), 846 states have call successors, (943) [2021-11-17 12:54:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 5669 transitions. [2021-11-17 12:54:03,527 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 5669 transitions. Word has length 267 [2021-11-17 12:54:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:54:03,527 INFO L470 AbstractCegarLoop]: Abstraction has 4196 states and 5669 transitions. [2021-11-17 12:54:03,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 6 states have internal predecessors, (135), 2 states have call successors, (52), 8 states have call predecessors, (52), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2021-11-17 12:54:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 5669 transitions. [2021-11-17 12:54:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-11-17 12:54:03,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:54:03,530 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:54:03,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-17 12:54:03,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:54:03,731 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ttusb_free_iso_urbsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:54:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:54:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 786890119, now seen corresponding path program 2 times [2021-11-17 12:54:03,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:54:03,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823251912] [2021-11-17 12:54:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:54:03,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:54:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:54:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:54:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:54:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:54:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:54:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:54:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:54:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:54:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:54:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:54:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:54:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 12:54:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 12:54:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-17 12:54:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 12:54:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 12:54:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 12:54:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 12:54:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 12:54:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-17 12:54:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-17 12:54:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-17 12:54:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-11-17 12:54:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-17 12:54:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-11-17 12:54:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-17 12:54:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2021-11-17 12:54:04,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:54:04,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823251912] [2021-11-17 12:54:04,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823251912] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:54:04,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131914612] [2021-11-17 12:54:04,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 12:54:04,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:54:04,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:54:04,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:54:04,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-17 12:54:05,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 12:54:05,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 12:54:05,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 3156 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-17 12:54:05,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:54:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2021-11-17 12:54:06,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:54:06,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131914612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:54:06,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 12:54:06,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12] total 22 [2021-11-17 12:54:06,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590595131] [2021-11-17 12:54:06,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:54:06,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-17 12:54:06,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:54:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-17 12:54:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2021-11-17 12:54:06,613 INFO L87 Difference]: Start difference. First operand 4196 states and 5669 transitions. Second operand has 14 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2021-11-17 12:54:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:54:08,247 INFO L93 Difference]: Finished difference Result 5379 states and 7175 transitions. [2021-11-17 12:54:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:54:08,248 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) Word has length 276 [2021-11-17 12:54:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:54:08,258 INFO L225 Difference]: With dead ends: 5379 [2021-11-17 12:54:08,258 INFO L226 Difference]: Without dead ends: 4196 [2021-11-17 12:54:08,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2021-11-17 12:54:08,262 INFO L933 BasicCegarLoop]: 1459 mSDtfsCounter, 38 mSDsluCounter, 17439 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18898 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:54:08,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 18898 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-17 12:54:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4196 states. [2021-11-17 12:54:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4196 to 4196. [2021-11-17 12:54:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 3068 states have (on average 1.2636897001303782) internal successors, (3877), 3138 states have internal predecessors, (3877), 848 states have call successors, (848), 266 states have call predecessors, (848), 276 states have return successors, (943), 848 states have call predecessors, (943), 846 states have call successors, (943) [2021-11-17 12:54:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 5668 transitions. [2021-11-17 12:54:08,525 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 5668 transitions. Word has length 276 [2021-11-17 12:54:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:54:08,525 INFO L470 AbstractCegarLoop]: Abstraction has 4196 states and 5668 transitions. [2021-11-17 12:54:08,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 6 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2021-11-17 12:54:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 5668 transitions. [2021-11-17 12:54:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2021-11-17 12:54:08,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:54:08,529 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 12:54:08,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-17 12:54:08,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:54:08,751 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ttusb_free_iso_urbsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-11-17 12:54:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:54:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash 179825617, now seen corresponding path program 1 times [2021-11-17 12:54:08,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:54:08,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982686003] [2021-11-17 12:54:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:54:08,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:54:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:54:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:54:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:54:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 12:54:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 12:54:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:54:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 12:54:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 12:54:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:54:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:54:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:54:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:54:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:54:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 12:54:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 12:54:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-11-17 12:54:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2021-11-17 12:54:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2021-11-17 12:54:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-17 12:54:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-11-17 12:54:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2021-11-17 12:54:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-11-17 12:54:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-11-17 12:54:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 12:54:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-11-17 12:54:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-11-17 12:54:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 12:54:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 12:54:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-11-17 12:54:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:54:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:54:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2021-11-17 12:54:09,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:54:09,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982686003] [2021-11-17 12:54:09,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982686003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:54:09,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:54:09,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:54:09,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428451] [2021-11-17 12:54:09,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:54:09,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:54:09,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:54:09,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:54:09,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:54:09,342 INFO L87 Difference]: Start difference. First operand 4196 states and 5668 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2021-11-17 12:54:11,366 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:13,451 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:15,550 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:17,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:21,149 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:23,268 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:25,291 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:31,720 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:33,888 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:36,483 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:38,503 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:54:40,541 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15