./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--net--can--janz-ican3.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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--net--can--janz-ican3.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 a63a35a997d4cef3a03c29c7166a2a1f9c94c58040c56bbf24b94b5923949bbd --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:00:38,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:00:38,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:00:38,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:00:38,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:00:38,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:00:38,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:00:38,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:00:38,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:00:38,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:00:38,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:00:38,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:00:38,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:00:38,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:00:38,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:00:38,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:00:38,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:00:38,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:00:38,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:00:38,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:00:38,333 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:00:38,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:00:38,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:00:38,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:00:38,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:00:38,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:00:38,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:00:38,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:00:38,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:00:38,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:00:38,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:00:38,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:00:38,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:00:38,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:00:38,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:00:38,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:00:38,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:00:38,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:00:38,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:00:38,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:00:38,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:00:38,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:00:38,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:00:38,373 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:00:38,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:00:38,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:00:38,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:00:38,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:00:38,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:00:38,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:00:38,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:00:38,375 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:00:38,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:00:38,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:00:38,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:00:38,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:00:38,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:00:38,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:00:38,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:00:38,376 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:00:38,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:00:38,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:00:38,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:00:38,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:00:38,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:00:38,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:00:38,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:00:38,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:00:38,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:00:38,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:00:38,378 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:00:38,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:00:38,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:00:38,379 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 -> a63a35a997d4cef3a03c29c7166a2a1f9c94c58040c56bbf24b94b5923949bbd [2022-07-12 17:00:38,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:00:38,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:00:38,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:00:38,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:00:38,584 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:00:38,585 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--net--can--janz-ican3.ko.cil.i [2022-07-12 17:00:38,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2925ed596/5713233e5624442b9531eb21b4915c25/FLAGee93dc5a5 [2022-07-12 17:00:39,275 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:00:39,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-07-12 17:00:39,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2925ed596/5713233e5624442b9531eb21b4915c25/FLAGee93dc5a5 [2022-07-12 17:00:39,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2925ed596/5713233e5624442b9531eb21b4915c25 [2022-07-12 17:00:39,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:00:39,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:00:39,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:00:39,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:00:39,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:00:39,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:00:39" (1/1) ... [2022-07-12 17:00:39,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c43642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:39, skipping insertion in model container [2022-07-12 17:00:39,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:00:39" (1/1) ... [2022-07-12 17:00:39,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:00:39,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:00:42,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397439,397452] [2022-07-12 17:00:42,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397584,397597] [2022-07-12 17:00:42,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397730,397743] [2022-07-12 17:00:42,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397895,397908] [2022-07-12 17:00:42,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398053,398066] [2022-07-12 17:00:42,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398211,398224] [2022-07-12 17:00:42,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398369,398382] [2022-07-12 17:00:42,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398529,398542] [2022-07-12 17:00:42,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398688,398701] [2022-07-12 17:00:42,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398827,398840] [2022-07-12 17:00:42,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398969,398982] [2022-07-12 17:00:42,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399118,399131] [2022-07-12 17:00:42,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399257,399270] [2022-07-12 17:00:42,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399412,399425] [2022-07-12 17:00:42,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399572,399585] [2022-07-12 17:00:42,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399723,399736] [2022-07-12 17:00:42,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399874,399887] [2022-07-12 17:00:42,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400026,400039] [2022-07-12 17:00:42,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400175,400188] [2022-07-12 17:00:42,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400323,400336] [2022-07-12 17:00:42,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400480,400493] [2022-07-12 17:00:42,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400629,400642] [2022-07-12 17:00:42,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400785,400798] [2022-07-12 17:00:42,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400938,400951] [2022-07-12 17:00:42,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401084,401097] [2022-07-12 17:00:42,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401227,401240] [2022-07-12 17:00:42,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401379,401392] [2022-07-12 17:00:42,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401525,401538] [2022-07-12 17:00:42,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401670,401683] [2022-07-12 17:00:42,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401824,401837] [2022-07-12 17:00:42,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401975,401988] [2022-07-12 17:00:42,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402130,402143] [2022-07-12 17:00:42,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402282,402295] [2022-07-12 17:00:42,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402437,402450] [2022-07-12 17:00:42,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402601,402614] [2022-07-12 17:00:42,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402757,402770] [2022-07-12 17:00:42,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402921,402934] [2022-07-12 17:00:42,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403063,403076] [2022-07-12 17:00:42,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403221,403234] [2022-07-12 17:00:42,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403388,403401] [2022-07-12 17:00:42,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403547,403560] [2022-07-12 17:00:42,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403706,403719] [2022-07-12 17:00:42,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403855,403868] [2022-07-12 17:00:42,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404002,404015] [2022-07-12 17:00:42,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404141,404154] [2022-07-12 17:00:42,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404304,404317] [2022-07-12 17:00:42,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404470,404483] [2022-07-12 17:00:42,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404634,404647] [2022-07-12 17:00:42,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404799,404812] [2022-07-12 17:00:42,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404964,404977] [2022-07-12 17:00:42,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405130,405143] [2022-07-12 17:00:42,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405295,405308] [2022-07-12 17:00:42,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405462,405475] [2022-07-12 17:00:42,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405622,405635] [2022-07-12 17:00:42,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405784,405797] [2022-07-12 17:00:42,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405943,405956] [2022-07-12 17:00:42,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406089,406102] [2022-07-12 17:00:42,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406232,406245] [2022-07-12 17:00:42,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406376,406389] [2022-07-12 17:00:42,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406519,406532] [2022-07-12 17:00:42,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406663,406676] [2022-07-12 17:00:42,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406804,406817] [2022-07-12 17:00:42,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406942,406955] [2022-07-12 17:00:42,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407100,407113] [2022-07-12 17:00:42,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407259,407272] [2022-07-12 17:00:42,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407415,407428] [2022-07-12 17:00:42,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407564,407577] [2022-07-12 17:00:42,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407716,407729] [2022-07-12 17:00:42,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407867,407880] [2022-07-12 17:00:42,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408016,408029] [2022-07-12 17:00:42,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408168,408181] [2022-07-12 17:00:42,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408316,408329] [2022-07-12 17:00:42,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2022-07-12 17:00:42,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408620,408633] [2022-07-12 17:00:42,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408770,408783] [2022-07-12 17:00:42,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408917,408930] [2022-07-12 17:00:42,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409068,409081] [2022-07-12 17:00:42,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409219,409232] [2022-07-12 17:00:42,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409367,409380] [2022-07-12 17:00:42,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2022-07-12 17:00:42,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2022-07-12 17:00:42,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2022-07-12 17:00:42,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2022-07-12 17:00:42,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2022-07-12 17:00:42,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2022-07-12 17:00:42,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410495,410508] [2022-07-12 17:00:42,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410665,410678] [2022-07-12 17:00:42,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410827,410840] [2022-07-12 17:00:42,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:00:42,612 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:00:42,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397439,397452] [2022-07-12 17:00:42,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397584,397597] [2022-07-12 17:00:42,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397730,397743] [2022-07-12 17:00:42,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397895,397908] [2022-07-12 17:00:42,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398053,398066] [2022-07-12 17:00:42,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398211,398224] [2022-07-12 17:00:42,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398369,398382] [2022-07-12 17:00:42,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398529,398542] [2022-07-12 17:00:42,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398688,398701] [2022-07-12 17:00:42,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398827,398840] [2022-07-12 17:00:42,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398969,398982] [2022-07-12 17:00:42,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399118,399131] [2022-07-12 17:00:42,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399257,399270] [2022-07-12 17:00:42,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399412,399425] [2022-07-12 17:00:42,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399572,399585] [2022-07-12 17:00:42,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399723,399736] [2022-07-12 17:00:42,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399874,399887] [2022-07-12 17:00:42,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400026,400039] [2022-07-12 17:00:42,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400175,400188] [2022-07-12 17:00:42,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400323,400336] [2022-07-12 17:00:42,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400480,400493] [2022-07-12 17:00:42,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400629,400642] [2022-07-12 17:00:42,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400785,400798] [2022-07-12 17:00:42,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400938,400951] [2022-07-12 17:00:42,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401084,401097] [2022-07-12 17:00:42,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401227,401240] [2022-07-12 17:00:42,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401379,401392] [2022-07-12 17:00:42,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401525,401538] [2022-07-12 17:00:42,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401670,401683] [2022-07-12 17:00:42,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401824,401837] [2022-07-12 17:00:42,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401975,401988] [2022-07-12 17:00:42,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402130,402143] [2022-07-12 17:00:42,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402282,402295] [2022-07-12 17:00:42,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402437,402450] [2022-07-12 17:00:42,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402601,402614] [2022-07-12 17:00:42,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402757,402770] [2022-07-12 17:00:42,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402921,402934] [2022-07-12 17:00:42,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403063,403076] [2022-07-12 17:00:42,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403221,403234] [2022-07-12 17:00:42,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403388,403401] [2022-07-12 17:00:42,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403547,403560] [2022-07-12 17:00:42,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403706,403719] [2022-07-12 17:00:42,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403855,403868] [2022-07-12 17:00:42,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404002,404015] [2022-07-12 17:00:42,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404141,404154] [2022-07-12 17:00:42,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404304,404317] [2022-07-12 17:00:42,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404470,404483] [2022-07-12 17:00:42,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404634,404647] [2022-07-12 17:00:42,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404799,404812] [2022-07-12 17:00:42,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404964,404977] [2022-07-12 17:00:42,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405130,405143] [2022-07-12 17:00:42,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405295,405308] [2022-07-12 17:00:42,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405462,405475] [2022-07-12 17:00:42,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405622,405635] [2022-07-12 17:00:42,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405784,405797] [2022-07-12 17:00:42,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405943,405956] [2022-07-12 17:00:42,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406089,406102] [2022-07-12 17:00:42,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406232,406245] [2022-07-12 17:00:42,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406376,406389] [2022-07-12 17:00:42,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406519,406532] [2022-07-12 17:00:42,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406663,406676] [2022-07-12 17:00:42,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406804,406817] [2022-07-12 17:00:42,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406942,406955] [2022-07-12 17:00:42,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407100,407113] [2022-07-12 17:00:42,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407259,407272] [2022-07-12 17:00:42,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407415,407428] [2022-07-12 17:00:42,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407564,407577] [2022-07-12 17:00:42,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407716,407729] [2022-07-12 17:00:42,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407867,407880] [2022-07-12 17:00:42,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408016,408029] [2022-07-12 17:00:42,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408168,408181] [2022-07-12 17:00:42,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408316,408329] [2022-07-12 17:00:42,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2022-07-12 17:00:42,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408620,408633] [2022-07-12 17:00:42,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408770,408783] [2022-07-12 17:00:42,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408917,408930] [2022-07-12 17:00:42,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409068,409081] [2022-07-12 17:00:42,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409219,409232] [2022-07-12 17:00:42,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409367,409380] [2022-07-12 17:00:42,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2022-07-12 17:00:42,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2022-07-12 17:00:42,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2022-07-12 17:00:42,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2022-07-12 17:00:42,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2022-07-12 17:00:42,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2022-07-12 17:00:42,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410495,410508] [2022-07-12 17:00:42,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410665,410678] [2022-07-12 17:00:42,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410827,410840] [2022-07-12 17:00:42,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:00:43,077 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:00:43,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43 WrapperNode [2022-07-12 17:00:43,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:00:43,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:00:43,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:00:43,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:00:43,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,287 INFO L137 Inliner]: procedures = 641, calls = 2563, calls flagged for inlining = 300, calls inlined = 195, statements flattened = 3322 [2022-07-12 17:00:43,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:00:43,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:00:43,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:00:43,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:00:43,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:00:43,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:00:43,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:00:43,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:00:43,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (1/1) ... [2022-07-12 17:00:43,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:00:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:00:43,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 17:00:43,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 17:00:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:00:43,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:00:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_open [2022-07-12 17:00:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_open [2022-07-12 17:00:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:00:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:00:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:00:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:00:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-12 17:00:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-12 17:00:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:00:43,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:00:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-07-12 17:00:43,520 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-07-12 17:00:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 17:00:43,520 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 17:00:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2022-07-12 17:00:43,520 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2022-07-12 17:00:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:00:43,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:00:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:00:43,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:00:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 17:00:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 17:00:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_reset_module [2022-07-12 17:00:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_reset_module [2022-07-12 17:00:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_bus_state [2022-07-12 17:00:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_bus_state [2022-07-12 17:00:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:00:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:00:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:00:43,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:00:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:00:43,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:00:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-12 17:00:43,523 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-12 17:00:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:00:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_buserror [2022-07-12 17:00:43,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_buserror [2022-07-12 17:00:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:00:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:00:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 17:00:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 17:00:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 17:00:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_remove [2022-07-12 17:00:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_remove [2022-07-12 17:00:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 17:00:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 17:00:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 17:00:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:00:43,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:00:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:00:43,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:00:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:00:43,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:00:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:00:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:00:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:00:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 17:00:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 17:00:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:00:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:00:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:00:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:00:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_txok [2022-07-12 17:00:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_txok [2022-07-12 17:00:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_termination [2022-07-12 17:00:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_termination [2022-07-12 17:00:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_msg [2022-07-12 17:00:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_msg [2022-07-12 17:00:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_page [2022-07-12 17:00:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_page [2022-07-12 17:00:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:00:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:00:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:00:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:00:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:00:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_inquiry [2022-07-12 17:00:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_inquiry [2022-07-12 17:00:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:00:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:00:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:00:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:00:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:00:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:00:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:00:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:00:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2022-07-12 17:00:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2022-07-12 17:00:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure napi_disable [2022-07-12 17:00:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_disable [2022-07-12 17:00:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 17:00:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 17:00:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:00:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:00:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-12 17:00:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-12 17:00:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:00:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:00:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 17:00:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 17:00:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:00:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:00:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_fromio [2022-07-12 17:00:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_fromio [2022-07-12 17:00:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:00:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:00:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-07-12 17:00:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-07-12 17:00:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_stop [2022-07-12 17:00:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_stop [2022-07-12 17:00:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 17:00:43,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 17:00:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-12 17:00:43,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-12 17:00:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 17:00:43,537 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 17:00:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_127 [2022-07-12 17:00:43,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_127 [2022-07-12 17:00:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:00:43,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:00:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:00:43,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:00:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:00:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:00:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:00:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:00:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-07-12 17:00:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-07-12 17:00:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_probe [2022-07-12 17:00:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_probe [2022-07-12 17:00:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:00:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-07-12 17:00:43,540 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-07-12 17:00:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-07-12 17:00:43,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-07-12 17:00:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:00:43,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:00:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 17:00:43,540 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 17:00:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2022-07-12 17:00:43,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2022-07-12 17:00:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:00:43,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:00:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-12 17:00:43,541 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-12 17:00:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-12 17:00:43,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-12 17:00:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:00:43,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:00:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:00:43,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:00:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:00:43,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:00:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 17:00:43,542 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 17:00:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:00:43,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:00:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:00:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:00:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:00:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:00:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:00:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:00:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:00:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:00:43,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:00:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:00:43,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:00:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:00:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-12 17:00:43,544 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-12 17:00:44,068 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:00:44,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:00:44,233 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:00:46,725 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:00:46,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:00:46,739 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 17:00:46,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:00:46 BoogieIcfgContainer [2022-07-12 17:00:46,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:00:46,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:00:46,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:00:46,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:00:46,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:00:39" (1/3) ... [2022-07-12 17:00:46,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db85aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:00:46, skipping insertion in model container [2022-07-12 17:00:46,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:00:43" (2/3) ... [2022-07-12 17:00:46,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db85aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:00:46, skipping insertion in model container [2022-07-12 17:00:46,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:00:46" (3/3) ... [2022-07-12 17:00:46,753 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-07-12 17:00:46,762 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:00:46,763 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-12 17:00:46,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:00:46,830 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78c8f89f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@487603b5 [2022-07-12 17:00:46,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-12 17:00:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 1261 states, 846 states have (on average 1.2647754137115839) internal successors, (1070), 893 states have internal predecessors, (1070), 308 states have call successors, (308), 78 states have call predecessors, (308), 77 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2022-07-12 17:00:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 17:00:46,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:46,846 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:00:46,846 INFO L420 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 27 more)] === [2022-07-12 17:00:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash 449709992, now seen corresponding path program 1 times [2022-07-12 17:00:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:46,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313187327] [2022-07-12 17:00:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:46,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:00:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:00:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:00:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:00:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:00:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:00:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:00:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:47,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313187327] [2022-07-12 17:00:47,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313187327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:47,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:47,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:47,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933858871] [2022-07-12 17:00:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:47,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:47,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:47,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:47,412 INFO L87 Difference]: Start difference. First operand has 1261 states, 846 states have (on average 1.2647754137115839) internal successors, (1070), 893 states have internal predecessors, (1070), 308 states have call successors, (308), 78 states have call predecessors, (308), 77 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 17:00:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:54,281 INFO L93 Difference]: Finished difference Result 3717 states and 5232 transitions. [2022-07-12 17:00:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:00:54,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-12 17:00:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:54,303 INFO L225 Difference]: With dead ends: 3717 [2022-07-12 17:00:54,303 INFO L226 Difference]: Without dead ends: 2453 [2022-07-12 17:00:54,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:00:54,321 INFO L413 NwaCegarLoop]: 2008 mSDtfsCounter, 3532 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 4161 mSolverCounterSat, 2167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3609 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 6328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2167 IncrementalHoareTripleChecker+Valid, 4161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:54,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3609 Valid, 3209 Invalid, 6328 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2167 Valid, 4161 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 17:00:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2022-07-12 17:00:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2254. [2022-07-12 17:00:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 1539 states have (on average 1.2267706302794021) internal successors, (1888), 1598 states have internal predecessors, (1888), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2022-07-12 17:00:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3020 transitions. [2022-07-12 17:00:54,487 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3020 transitions. Word has length 64 [2022-07-12 17:00:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:54,488 INFO L495 AbstractCegarLoop]: Abstraction has 2254 states and 3020 transitions. [2022-07-12 17:00:54,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 17:00:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3020 transitions. [2022-07-12 17:00:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 17:00:54,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:54,490 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:00:54,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:00:54,491 INFO L420 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 27 more)] === [2022-07-12 17:00:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:54,491 INFO L85 PathProgramCache]: Analyzing trace with hash -733384379, now seen corresponding path program 1 times [2022-07-12 17:00:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:54,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468923928] [2022-07-12 17:00:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:00:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:00:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:00:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:00:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:00:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:00:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:00:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:00:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:54,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468923928] [2022-07-12 17:00:54,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468923928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:54,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:54,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:54,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670329782] [2022-07-12 17:00:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:54,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:54,695 INFO L87 Difference]: Start difference. First operand 2254 states and 3020 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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) [2022-07-12 17:00:56,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:00:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:59,019 INFO L93 Difference]: Finished difference Result 2254 states and 3020 transitions. [2022-07-12 17:00:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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 70 [2022-07-12 17:00:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:59,030 INFO L225 Difference]: With dead ends: 2254 [2022-07-12 17:00:59,030 INFO L226 Difference]: Without dead ends: 2252 [2022-07-12 17:00:59,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:00:59,032 INFO L413 NwaCegarLoop]: 1428 mSDtfsCounter, 2661 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2759 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:59,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2759 Valid, 2266 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 17:00:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2022-07-12 17:00:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2252. [2022-07-12 17:00:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 1538 states have (on average 1.2262678803641092) internal successors, (1886), 1596 states have internal predecessors, (1886), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2022-07-12 17:00:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3018 transitions. [2022-07-12 17:00:59,091 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3018 transitions. Word has length 70 [2022-07-12 17:00:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:59,092 INFO L495 AbstractCegarLoop]: Abstraction has 2252 states and 3018 transitions. [2022-07-12 17:00:59,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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) [2022-07-12 17:00:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3018 transitions. [2022-07-12 17:00:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 17:00:59,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:59,094 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:00:59,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:00:59,094 INFO L420 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 27 more)] === [2022-07-12 17:00:59,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash -574634998, now seen corresponding path program 1 times [2022-07-12 17:00:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:59,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777664637] [2022-07-12 17:00:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:59,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:00:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:00:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:00:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:00:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:00:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:00:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:00:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:00:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:00:59,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:59,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777664637] [2022-07-12 17:00:59,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777664637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:59,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:59,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:59,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226897670] [2022-07-12 17:00:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:59,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:59,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:59,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:59,343 INFO L87 Difference]: Start difference. First operand 2252 states and 3018 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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) [2022-07-12 17:01:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:02,047 INFO L93 Difference]: Finished difference Result 2252 states and 3018 transitions. [2022-07-12 17:01:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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 76 [2022-07-12 17:01:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:02,057 INFO L225 Difference]: With dead ends: 2252 [2022-07-12 17:01:02,057 INFO L226 Difference]: Without dead ends: 2250 [2022-07-12 17:01:02,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:02,059 INFO L413 NwaCegarLoop]: 1426 mSDtfsCounter, 2655 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:02,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 2264 Invalid, 3056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 17:01:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2022-07-12 17:01:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2250. [2022-07-12 17:01:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 1537 states have (on average 1.2257644762524398) internal successors, (1884), 1594 states have internal predecessors, (1884), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2022-07-12 17:01:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3016 transitions. [2022-07-12 17:01:02,157 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3016 transitions. Word has length 76 [2022-07-12 17:01:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:02,158 INFO L495 AbstractCegarLoop]: Abstraction has 2250 states and 3016 transitions. [2022-07-12 17:01:02,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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) [2022-07-12 17:01:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3016 transitions. [2022-07-12 17:01:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 17:01:02,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:02,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:02,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:01:02,159 INFO L420 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 27 more)] === [2022-07-12 17:01:02,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:02,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1881413847, now seen corresponding path program 1 times [2022-07-12 17:01:02,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:02,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081281888] [2022-07-12 17:01:02,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:02,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:02,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:02,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081281888] [2022-07-12 17:01:02,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081281888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:02,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:02,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:02,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684809904] [2022-07-12 17:01:02,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:02,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:02,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:02,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:02,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:02,338 INFO L87 Difference]: Start difference. First operand 2250 states and 3016 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-07-12 17:01:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:05,695 INFO L93 Difference]: Finished difference Result 2250 states and 3016 transitions. [2022-07-12 17:01:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:05,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 82 [2022-07-12 17:01:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:05,708 INFO L225 Difference]: With dead ends: 2250 [2022-07-12 17:01:05,708 INFO L226 Difference]: Without dead ends: 2248 [2022-07-12 17:01:05,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:05,710 INFO L413 NwaCegarLoop]: 1424 mSDtfsCounter, 2649 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2745 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:05,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2745 Valid, 2262 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 17:01:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2022-07-12 17:01:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2248. [2022-07-12 17:01:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1536 states have (on average 1.2252604166666667) internal successors, (1882), 1592 states have internal predecessors, (1882), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2022-07-12 17:01:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3014 transitions. [2022-07-12 17:01:05,779 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3014 transitions. Word has length 82 [2022-07-12 17:01:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:05,779 INFO L495 AbstractCegarLoop]: Abstraction has 2248 states and 3014 transitions. [2022-07-12 17:01:05,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-07-12 17:01:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3014 transitions. [2022-07-12 17:01:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 17:01:05,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:05,782 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 17:01:05,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:01:05,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:01:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1455084961, now seen corresponding path program 1 times [2022-07-12 17:01:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:05,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991358101] [2022-07-12 17:01:05,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:01:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:01:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:01:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:06,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:01:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:01:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:01:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 17:01:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:06,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991358101] [2022-07-12 17:01:06,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991358101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:06,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:06,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:01:06,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449180318] [2022-07-12 17:01:06,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:06,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:01:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:06,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:01:06,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:01:06,067 INFO L87 Difference]: Start difference. First operand 2248 states and 3014 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 17:01:08,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:01:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:11,053 INFO L93 Difference]: Finished difference Result 4540 states and 6203 transitions. [2022-07-12 17:01:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2022-07-12 17:01:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:11,069 INFO L225 Difference]: With dead ends: 4540 [2022-07-12 17:01:11,069 INFO L226 Difference]: Without dead ends: 2311 [2022-07-12 17:01:11,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:01:11,081 INFO L413 NwaCegarLoop]: 1284 mSDtfsCounter, 3311 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 2258 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3414 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2258 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:11,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3414 Valid, 1992 Invalid, 3710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2258 Valid, 1451 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-07-12 17:01:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-07-12 17:01:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2255. [2022-07-12 17:01:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1540 states have (on average 1.2227272727272727) internal successors, (1883), 1597 states have internal predecessors, (1883), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-12 17:01:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3045 transitions. [2022-07-12 17:01:11,176 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3045 transitions. Word has length 93 [2022-07-12 17:01:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:11,177 INFO L495 AbstractCegarLoop]: Abstraction has 2255 states and 3045 transitions. [2022-07-12 17:01:11,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 17:01:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3045 transitions. [2022-07-12 17:01:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 17:01:11,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:11,178 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:11,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:01:11,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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 27 more)] === [2022-07-12 17:01:11,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash -174515702, now seen corresponding path program 1 times [2022-07-12 17:01:11,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:11,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689503630] [2022-07-12 17:01:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:11,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:11,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:11,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689503630] [2022-07-12 17:01:11,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689503630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:11,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:11,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131395465] [2022-07-12 17:01:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:11,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:11,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:11,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:11,364 INFO L87 Difference]: Start difference. First operand 2255 states and 3045 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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) [2022-07-12 17:01:12,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:01:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:14,797 INFO L93 Difference]: Finished difference Result 2255 states and 3045 transitions. [2022-07-12 17:01:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:14,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 88 [2022-07-12 17:01:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:14,807 INFO L225 Difference]: With dead ends: 2255 [2022-07-12 17:01:14,807 INFO L226 Difference]: Without dead ends: 2253 [2022-07-12 17:01:14,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:14,809 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 2638 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:14,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 2241 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 17:01:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2022-07-12 17:01:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2253. [2022-07-12 17:01:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 1539 states have (on average 1.2222222222222223) internal successors, (1881), 1595 states have internal predecessors, (1881), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-12 17:01:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3043 transitions. [2022-07-12 17:01:14,914 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3043 transitions. Word has length 88 [2022-07-12 17:01:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:14,915 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 3043 transitions. [2022-07-12 17:01:14,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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) [2022-07-12 17:01:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3043 transitions. [2022-07-12 17:01:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 17:01:14,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:14,917 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 17:01:14,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:01:14,917 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:01:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 936118704, now seen corresponding path program 1 times [2022-07-12 17:01:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:14,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878434975] [2022-07-12 17:01:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:01:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:01:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:01:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:01:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:01:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:01:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:01:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 17:01:15,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:15,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878434975] [2022-07-12 17:01:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878434975] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:01:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617443937] [2022-07-12 17:01:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:15,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:01:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:01:15,144 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) [2022-07-12 17:01:15,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 17:01:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:15,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:01:15,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:01:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 17:01:15,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:01:15,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617443937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:15,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:01:15,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-12 17:01:15,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925021958] [2022-07-12 17:01:15,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:15,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:01:15,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:15,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:01:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:01:15,663 INFO L87 Difference]: Start difference. First operand 2253 states and 3043 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:01:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:15,790 INFO L93 Difference]: Finished difference Result 4481 states and 6051 transitions. [2022-07-12 17:01:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:01:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2022-07-12 17:01:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:15,802 INFO L225 Difference]: With dead ends: 4481 [2022-07-12 17:01:15,803 INFO L226 Difference]: Without dead ends: 2247 [2022-07-12 17:01:15,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:01:15,813 INFO L413 NwaCegarLoop]: 1606 mSDtfsCounter, 1586 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:15,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 1606 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:01:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-07-12 17:01:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2247. [2022-07-12 17:01:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 1534 states have (on average 1.2203389830508475) internal successors, (1872), 1589 states have internal predecessors, (1872), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-12 17:01:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3034 transitions. [2022-07-12 17:01:15,927 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3034 transitions. Word has length 99 [2022-07-12 17:01:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:15,928 INFO L495 AbstractCegarLoop]: Abstraction has 2247 states and 3034 transitions. [2022-07-12 17:01:15,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:01:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3034 transitions. [2022-07-12 17:01:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 17:01:15,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:15,930 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:15,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 17:01:16,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:01:16,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 27 more)] === [2022-07-12 17:01:16,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash 320510551, now seen corresponding path program 1 times [2022-07-12 17:01:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:16,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531066257] [2022-07-12 17:01:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:16,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531066257] [2022-07-12 17:01:16,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531066257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:16,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:16,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547874138] [2022-07-12 17:01:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:16,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:16,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:16,372 INFO L87 Difference]: Start difference. First operand 2247 states and 3034 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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) [2022-07-12 17:01:18,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:01:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:20,822 INFO L93 Difference]: Finished difference Result 2247 states and 3034 transitions. [2022-07-12 17:01:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:20,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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 94 [2022-07-12 17:01:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:20,831 INFO L225 Difference]: With dead ends: 2247 [2022-07-12 17:01:20,831 INFO L226 Difference]: Without dead ends: 2245 [2022-07-12 17:01:20,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:20,849 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 2627 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2721 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:20,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2721 Valid, 2220 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1673 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 17:01:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2022-07-12 17:01:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2022-07-12 17:01:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1533 states have (on average 1.2198303979125897) internal successors, (1870), 1587 states have internal predecessors, (1870), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-12 17:01:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3032 transitions. [2022-07-12 17:01:20,929 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3032 transitions. Word has length 94 [2022-07-12 17:01:20,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:20,930 INFO L495 AbstractCegarLoop]: Abstraction has 2245 states and 3032 transitions. [2022-07-12 17:01:20,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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) [2022-07-12 17:01:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3032 transitions. [2022-07-12 17:01:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 17:01:20,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:20,934 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:20,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:01:20,934 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 27 more)] === [2022-07-12 17:01:20,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 816605428, now seen corresponding path program 1 times [2022-07-12 17:01:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:20,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090871050] [2022-07-12 17:01:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:01:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:21,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:21,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090871050] [2022-07-12 17:01:21,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090871050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:21,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:21,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:21,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218761389] [2022-07-12 17:01:21,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:21,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:21,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:21,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:21,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:21,138 INFO L87 Difference]: Start difference. First operand 2245 states and 3032 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-07-12 17:01:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:24,017 INFO L93 Difference]: Finished difference Result 2245 states and 3032 transitions. [2022-07-12 17:01:24,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 100 [2022-07-12 17:01:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:24,025 INFO L225 Difference]: With dead ends: 2245 [2022-07-12 17:01:24,025 INFO L226 Difference]: Without dead ends: 2243 [2022-07-12 17:01:24,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:24,028 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 2621 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2714 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:24,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2714 Valid, 2218 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-12 17:01:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2022-07-12 17:01:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2243. [2022-07-12 17:01:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2243 states, 1532 states have (on average 1.2193211488250653) internal successors, (1868), 1585 states have internal predecessors, (1868), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-12 17:01:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3030 transitions. [2022-07-12 17:01:24,107 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3030 transitions. Word has length 100 [2022-07-12 17:01:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:24,108 INFO L495 AbstractCegarLoop]: Abstraction has 2243 states and 3030 transitions. [2022-07-12 17:01:24,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-07-12 17:01:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3030 transitions. [2022-07-12 17:01:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 17:01:24,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:24,111 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:24,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:01:24,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 27 more)] === [2022-07-12 17:01:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1330511425, now seen corresponding path program 1 times [2022-07-12 17:01:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:24,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250007879] [2022-07-12 17:01:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:24,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:01:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:24,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:24,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250007879] [2022-07-12 17:01:24,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250007879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:24,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:24,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010684129] [2022-07-12 17:01:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:24,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:24,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:24,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:24,303 INFO L87 Difference]: Start difference. First operand 2243 states and 3030 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-07-12 17:01:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:27,193 INFO L93 Difference]: Finished difference Result 2243 states and 3030 transitions. [2022-07-12 17:01:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:27,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 106 [2022-07-12 17:01:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:27,201 INFO L225 Difference]: With dead ends: 2243 [2022-07-12 17:01:27,202 INFO L226 Difference]: Without dead ends: 2241 [2022-07-12 17:01:27,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:27,203 INFO L413 NwaCegarLoop]: 1406 mSDtfsCounter, 2619 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2711 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:27,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2711 Valid, 2216 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-12 17:01:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2022-07-12 17:01:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2022-07-12 17:01:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1531 states have (on average 1.2188112344872633) internal successors, (1866), 1583 states have internal predecessors, (1866), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-12 17:01:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3028 transitions. [2022-07-12 17:01:27,291 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3028 transitions. Word has length 106 [2022-07-12 17:01:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:27,292 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 3028 transitions. [2022-07-12 17:01:27,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-07-12 17:01:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3028 transitions. [2022-07-12 17:01:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 17:01:27,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:27,294 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:27,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:01:27,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 27 more)] === [2022-07-12 17:01:27,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:27,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1278913922, now seen corresponding path program 1 times [2022-07-12 17:01:27,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:27,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985785653] [2022-07-12 17:01:27,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:01:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:27,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985785653] [2022-07-12 17:01:27,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985785653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:27,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:27,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:27,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129647174] [2022-07-12 17:01:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:27,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:27,445 INFO L87 Difference]: Start difference. First operand 2241 states and 3028 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-12 17:01:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:30,746 INFO L93 Difference]: Finished difference Result 2241 states and 3028 transitions. [2022-07-12 17:01:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:30,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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 108 [2022-07-12 17:01:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:30,761 INFO L225 Difference]: With dead ends: 2241 [2022-07-12 17:01:30,761 INFO L226 Difference]: Without dead ends: 2239 [2022-07-12 17:01:30,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:30,762 INFO L413 NwaCegarLoop]: 1404 mSDtfsCounter, 2607 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2699 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:30,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2699 Valid, 2214 Invalid, 3042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 17:01:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2239 states. [2022-07-12 17:01:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2239 to 2239. [2022-07-12 17:01:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 1530 states have (on average 1.2183006535947711) internal successors, (1864), 1581 states have internal predecessors, (1864), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-12 17:01:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3026 transitions. [2022-07-12 17:01:30,878 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3026 transitions. Word has length 108 [2022-07-12 17:01:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:30,880 INFO L495 AbstractCegarLoop]: Abstraction has 2239 states and 3026 transitions. [2022-07-12 17:01:30,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-12 17:01:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3026 transitions. [2022-07-12 17:01:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 17:01:30,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:30,881 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:30,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:01:30,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 27 more)] === [2022-07-12 17:01:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1412026439, now seen corresponding path program 1 times [2022-07-12 17:01:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:30,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821249402] [2022-07-12 17:01:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:30,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:30,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:30,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:30,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:01:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:01:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:31,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821249402] [2022-07-12 17:01:31,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821249402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:31,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:31,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976514379] [2022-07-12 17:01:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:31,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:31,048 INFO L87 Difference]: Start difference. First operand 2239 states and 3026 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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) [2022-07-12 17:01:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:33,613 INFO L93 Difference]: Finished difference Result 2239 states and 3026 transitions. [2022-07-12 17:01:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:33,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 114 [2022-07-12 17:01:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:33,621 INFO L225 Difference]: With dead ends: 2239 [2022-07-12 17:01:33,621 INFO L226 Difference]: Without dead ends: 2237 [2022-07-12 17:01:33,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:33,624 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 2603 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2694 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:33,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2694 Valid, 2212 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 17:01:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2022-07-12 17:01:33,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2237. [2022-07-12 17:01:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 1529 states have (on average 1.2177894048397646) internal successors, (1862), 1579 states have internal predecessors, (1862), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2022-07-12 17:01:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3024 transitions. [2022-07-12 17:01:33,721 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3024 transitions. Word has length 114 [2022-07-12 17:01:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:33,722 INFO L495 AbstractCegarLoop]: Abstraction has 2237 states and 3024 transitions. [2022-07-12 17:01:33,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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) [2022-07-12 17:01:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3024 transitions. [2022-07-12 17:01:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 17:01:33,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:33,723 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-12 17:01:33,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:01:33,724 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__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 27 more)] === [2022-07-12 17:01:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1654081674, now seen corresponding path program 1 times [2022-07-12 17:01:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:33,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892208817] [2022-07-12 17:01:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 17:01:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:01:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:01:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:01:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 17:01:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 17:01:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:01:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-12 17:01:34,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:34,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892208817] [2022-07-12 17:01:34,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892208817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:34,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:34,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:01:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673967388] [2022-07-12 17:01:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:34,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:01:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:01:34,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:01:34,021 INFO L87 Difference]: Start difference. First operand 2237 states and 3024 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:01:36,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:01:39,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:01:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:43,811 INFO L93 Difference]: Finished difference Result 2499 states and 3484 transitions. [2022-07-12 17:01:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:01:43,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 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 139 [2022-07-12 17:01:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:43,818 INFO L225 Difference]: With dead ends: 2499 [2022-07-12 17:01:43,819 INFO L226 Difference]: Without dead ends: 2497 [2022-07-12 17:01:43,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-07-12 17:01:43,820 INFO L413 NwaCegarLoop]: 1389 mSDtfsCounter, 3307 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 5033 mSolverCounterSat, 2332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3374 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 7365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2332 IncrementalHoareTripleChecker+Valid, 5033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:43,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3374 Valid, 2956 Invalid, 7365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2332 Valid, 5033 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-07-12 17:01:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2022-07-12 17:01:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2370. [2022-07-12 17:01:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 1616 states have (on average 1.2097772277227723) internal successors, (1955), 1667 states have internal predecessors, (1955), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:01:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3158 transitions. [2022-07-12 17:01:43,913 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3158 transitions. Word has length 139 [2022-07-12 17:01:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:43,914 INFO L495 AbstractCegarLoop]: Abstraction has 2370 states and 3158 transitions. [2022-07-12 17:01:43,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:01:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3158 transitions. [2022-07-12 17:01:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 17:01:43,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:43,915 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:43,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:01:43,916 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 27 more)] === [2022-07-12 17:01:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash 861903971, now seen corresponding path program 1 times [2022-07-12 17:01:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:43,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588462223] [2022-07-12 17:01:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:43,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:01:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:01:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:01:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:44,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588462223] [2022-07-12 17:01:44,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588462223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:44,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:44,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897100586] [2022-07-12 17:01:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:44,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:44,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:44,080 INFO L87 Difference]: Start difference. First operand 2370 states and 3158 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2022-07-12 17:01:45,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:01:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:47,732 INFO L93 Difference]: Finished difference Result 2370 states and 3158 transitions. [2022-07-12 17:01:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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 120 [2022-07-12 17:01:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:47,739 INFO L225 Difference]: With dead ends: 2370 [2022-07-12 17:01:47,739 INFO L226 Difference]: Without dead ends: 2368 [2022-07-12 17:01:47,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:47,740 INFO L413 NwaCegarLoop]: 1398 mSDtfsCounter, 2591 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:47,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 2208 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 17:01:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-12 17:01:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2022-07-12 17:01:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1615 states have (on average 1.2092879256965945) internal successors, (1953), 1665 states have internal predecessors, (1953), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:01:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3156 transitions. [2022-07-12 17:01:47,870 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3156 transitions. Word has length 120 [2022-07-12 17:01:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:47,871 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3156 transitions. [2022-07-12 17:01:47,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2022-07-12 17:01:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3156 transitions. [2022-07-12 17:01:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 17:01:47,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:47,872 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:47,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:01:47,873 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:01:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash 805151419, now seen corresponding path program 1 times [2022-07-12 17:01:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:47,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278086609] [2022-07-12 17:01:47,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:47,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:01:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:01:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:01:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:01:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:48,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278086609] [2022-07-12 17:01:48,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278086609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:48,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:48,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133738362] [2022-07-12 17:01:48,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:48,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:48,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:48,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:48,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:48,067 INFO L87 Difference]: Start difference. First operand 2368 states and 3156 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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) [2022-07-12 17:01:49,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:01:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:51,876 INFO L93 Difference]: Finished difference Result 2368 states and 3156 transitions. [2022-07-12 17:01:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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 126 [2022-07-12 17:01:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:51,884 INFO L225 Difference]: With dead ends: 2368 [2022-07-12 17:01:51,884 INFO L226 Difference]: Without dead ends: 2366 [2022-07-12 17:01:51,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:51,886 INFO L413 NwaCegarLoop]: 1396 mSDtfsCounter, 2585 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:51,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 2206 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 17:01:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2022-07-12 17:01:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2022-07-12 17:01:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1614 states have (on average 1.2087980173482031) internal successors, (1951), 1663 states have internal predecessors, (1951), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:01:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3154 transitions. [2022-07-12 17:01:52,027 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3154 transitions. Word has length 126 [2022-07-12 17:01:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:52,027 INFO L495 AbstractCegarLoop]: Abstraction has 2366 states and 3154 transitions. [2022-07-12 17:01:52,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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) [2022-07-12 17:01:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3154 transitions. [2022-07-12 17:01:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 17:01:52,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:52,030 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:52,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:01:52,030 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 27 more)] === [2022-07-12 17:01:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1795330939, now seen corresponding path program 1 times [2022-07-12 17:01:52,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:52,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835499048] [2022-07-12 17:01:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:01:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:01:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:01:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:01:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:01:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:52,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835499048] [2022-07-12 17:01:52,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835499048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:52,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:52,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422248917] [2022-07-12 17:01:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:52,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:52,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:52,269 INFO L87 Difference]: Start difference. First operand 2366 states and 3154 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-12 17:01:53,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:01:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:55,833 INFO L93 Difference]: Finished difference Result 2366 states and 3154 transitions. [2022-07-12 17:01:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:55,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 132 [2022-07-12 17:01:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:55,839 INFO L225 Difference]: With dead ends: 2366 [2022-07-12 17:01:55,840 INFO L226 Difference]: Without dead ends: 2364 [2022-07-12 17:01:55,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:01:55,841 INFO L413 NwaCegarLoop]: 1394 mSDtfsCounter, 2579 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:55,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 2204 Invalid, 3032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 17:01:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2022-07-12 17:01:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2364. [2022-07-12 17:01:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 1613 states have (on average 1.208307501549907) internal successors, (1949), 1661 states have internal predecessors, (1949), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:01:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3152 transitions. [2022-07-12 17:01:55,935 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3152 transitions. Word has length 132 [2022-07-12 17:01:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:55,935 INFO L495 AbstractCegarLoop]: Abstraction has 2364 states and 3152 transitions. [2022-07-12 17:01:55,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-12 17:01:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3152 transitions. [2022-07-12 17:01:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 17:01:55,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:55,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:01:55,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:01:55,937 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 27 more)] === [2022-07-12 17:01:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash 710341783, now seen corresponding path program 1 times [2022-07-12 17:01:55,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:55,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75803410] [2022-07-12 17:01:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:01:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:01:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:01:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:01:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:01:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:01:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:01:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:01:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:01:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:01:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:01:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:01:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:01:56,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:56,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75803410] [2022-07-12 17:01:56,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75803410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:56,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:56,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960669621] [2022-07-12 17:01:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:56,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:56,093 INFO L87 Difference]: Start difference. First operand 2364 states and 3152 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2022-07-12 17:01:58,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:00,069 INFO L93 Difference]: Finished difference Result 2364 states and 3152 transitions. [2022-07-12 17:02:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:02:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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 138 [2022-07-12 17:02:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:00,076 INFO L225 Difference]: With dead ends: 2364 [2022-07-12 17:02:00,076 INFO L226 Difference]: Without dead ends: 2362 [2022-07-12 17:02:00,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:00,077 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 2573 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 3030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:00,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 2202 Invalid, 3030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 17:02:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-07-12 17:02:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-07-12 17:02:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 1612 states have (on average 1.2078163771712158) internal successors, (1947), 1659 states have internal predecessors, (1947), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:02:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3150 transitions. [2022-07-12 17:02:00,178 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3150 transitions. Word has length 138 [2022-07-12 17:02:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:00,179 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 3150 transitions. [2022-07-12 17:02:00,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2022-07-12 17:02:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3150 transitions. [2022-07-12 17:02:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 17:02:00,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:00,181 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:02:00,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:02:00,181 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 27 more)] === [2022-07-12 17:02:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1918936592, now seen corresponding path program 1 times [2022-07-12 17:02:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:00,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737736730] [2022-07-12 17:02:00,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:02:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:02:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:02:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:02:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:02:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:02:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:02:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:02:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:02:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:02:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:02:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:02:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:02:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:02:00,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:00,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737736730] [2022-07-12 17:02:00,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737736730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:00,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:00,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:02:00,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289638739] [2022-07-12 17:02:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:00,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:02:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:00,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:02:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:02:00,393 INFO L87 Difference]: Start difference. First operand 2362 states and 3150 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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) [2022-07-12 17:02:02,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:04,390 INFO L93 Difference]: Finished difference Result 2362 states and 3150 transitions. [2022-07-12 17:02:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:02:04,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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 144 [2022-07-12 17:02:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:04,398 INFO L225 Difference]: With dead ends: 2362 [2022-07-12 17:02:04,398 INFO L226 Difference]: Without dead ends: 2360 [2022-07-12 17:02:04,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:04,401 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 2567 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 3028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:04,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 2200 Invalid, 3028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 17:02:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-07-12 17:02:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2360. [2022-07-12 17:02:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 1611 states have (on average 1.207324643078833) internal successors, (1945), 1657 states have internal predecessors, (1945), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:02:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3148 transitions. [2022-07-12 17:02:04,545 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3148 transitions. Word has length 144 [2022-07-12 17:02:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:04,545 INFO L495 AbstractCegarLoop]: Abstraction has 2360 states and 3148 transitions. [2022-07-12 17:02:04,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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) [2022-07-12 17:02:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3148 transitions. [2022-07-12 17:02:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 17:02:04,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:04,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:02:04,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:02:04,548 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 27 more)] === [2022-07-12 17:02:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash -200822391, now seen corresponding path program 1 times [2022-07-12 17:02:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:04,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310290258] [2022-07-12 17:02:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:02:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:02:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:02:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:02:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:02:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:02:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:02:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:02:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:02:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:02:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:02:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:02:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:02:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:02:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:02:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:04,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310290258] [2022-07-12 17:02:04,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310290258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:04,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:04,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:02:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787066252] [2022-07-12 17:02:04,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:04,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:02:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:02:04,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:02:04,786 INFO L87 Difference]: Start difference. First operand 2360 states and 3148 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-12 17:02:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:07,896 INFO L93 Difference]: Finished difference Result 2360 states and 3148 transitions. [2022-07-12 17:02:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:02:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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 150 [2022-07-12 17:02:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:07,903 INFO L225 Difference]: With dead ends: 2360 [2022-07-12 17:02:07,903 INFO L226 Difference]: Without dead ends: 2358 [2022-07-12 17:02:07,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:07,904 INFO L413 NwaCegarLoop]: 1388 mSDtfsCounter, 2561 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:07,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2646 Valid, 2198 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 17:02:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2022-07-12 17:02:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2358. [2022-07-12 17:02:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1610 states have (on average 1.206832298136646) internal successors, (1943), 1655 states have internal predecessors, (1943), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:02:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3146 transitions. [2022-07-12 17:02:08,010 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3146 transitions. Word has length 150 [2022-07-12 17:02:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:08,010 INFO L495 AbstractCegarLoop]: Abstraction has 2358 states and 3146 transitions. [2022-07-12 17:02:08,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-12 17:02:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3146 transitions. [2022-07-12 17:02:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 17:02:08,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:08,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:02:08,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:02:08,013 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 27 more)] === [2022-07-12 17:02:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1793514094, now seen corresponding path program 1 times [2022-07-12 17:02:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:08,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216044108] [2022-07-12 17:02:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:02:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:02:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:02:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:02:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:02:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:02:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:02:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:02:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:02:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:02:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:02:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:02:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:02:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:02:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:02:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:02:08,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:08,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216044108] [2022-07-12 17:02:08,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216044108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:08,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:08,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:02:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238097226] [2022-07-12 17:02:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:08,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:02:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:02:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:02:08,187 INFO L87 Difference]: Start difference. First operand 2358 states and 3146 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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) [2022-07-12 17:02:09,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:11,989 INFO L93 Difference]: Finished difference Result 2358 states and 3146 transitions. [2022-07-12 17:02:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:02:11,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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 156 [2022-07-12 17:02:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:11,995 INFO L225 Difference]: With dead ends: 2358 [2022-07-12 17:02:11,996 INFO L226 Difference]: Without dead ends: 2356 [2022-07-12 17:02:11,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:11,997 INFO L413 NwaCegarLoop]: 1386 mSDtfsCounter, 2555 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:11,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2639 Valid, 2196 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 17:02:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-07-12 17:02:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2356. [2022-07-12 17:02:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1609 states have (on average 1.2063393412057177) internal successors, (1941), 1653 states have internal predecessors, (1941), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:02:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3144 transitions. [2022-07-12 17:02:12,121 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3144 transitions. Word has length 156 [2022-07-12 17:02:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:12,121 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 3144 transitions. [2022-07-12 17:02:12,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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) [2022-07-12 17:02:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3144 transitions. [2022-07-12 17:02:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 17:02:12,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:12,124 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:02:12,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:02:12,124 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 27 more)] === [2022-07-12 17:02:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash 544423176, now seen corresponding path program 1 times [2022-07-12 17:02:12,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:12,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669597820] [2022-07-12 17:02:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:12,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:02:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:02:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:02:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:02:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:02:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:02:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:02:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:02:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:02:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:02:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:02:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:02:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:02:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:02:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:02:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:02:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:02:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:12,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669597820] [2022-07-12 17:02:12,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669597820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:12,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:12,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:02:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474257273] [2022-07-12 17:02:12,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:12,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:02:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:02:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:02:12,325 INFO L87 Difference]: Start difference. First operand 2356 states and 3144 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-12 17:02:14,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:16,699 INFO L93 Difference]: Finished difference Result 2356 states and 3144 transitions. [2022-07-12 17:02:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:02:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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 162 [2022-07-12 17:02:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:16,706 INFO L225 Difference]: With dead ends: 2356 [2022-07-12 17:02:16,707 INFO L226 Difference]: Without dead ends: 2354 [2022-07-12 17:02:16,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:16,708 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 2549 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2632 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:16,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2632 Valid, 2194 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1647 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 17:02:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2022-07-12 17:02:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2022-07-12 17:02:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 1608 states have (on average 1.2058457711442787) internal successors, (1939), 1651 states have internal predecessors, (1939), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:02:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 3142 transitions. [2022-07-12 17:02:16,826 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 3142 transitions. Word has length 162 [2022-07-12 17:02:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:16,826 INFO L495 AbstractCegarLoop]: Abstraction has 2354 states and 3142 transitions. [2022-07-12 17:02:16,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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) [2022-07-12 17:02:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3142 transitions. [2022-07-12 17:02:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-12 17:02:16,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:16,830 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 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] [2022-07-12 17:02:16,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:02:16,830 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_assert_linux_kernel_locking_spinlock__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 27 more)] === [2022-07-12 17:02:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:16,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1029405853, now seen corresponding path program 1 times [2022-07-12 17:02:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:16,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047914107] [2022-07-12 17:02:16,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 17:02:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:02:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:02:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:02:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:02:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:02:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:02:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:02:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 17:02:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 17:02:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:02:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:02:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:02:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 17:02:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 17:02:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 17:02:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 17:02:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:02:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 17:02:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-07-12 17:02:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:17,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047914107] [2022-07-12 17:02:17,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047914107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:17,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:17,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:02:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677566757] [2022-07-12 17:02:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:17,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:02:17,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:17,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:02:17,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:17,112 INFO L87 Difference]: Start difference. First operand 2354 states and 3142 transitions. Second operand has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-12 17:02:19,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:22,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:24,591 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:26,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:32,292 INFO L93 Difference]: Finished difference Result 2632 states and 3755 transitions. [2022-07-12 17:02:32,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 17:02:32,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) Word has length 189 [2022-07-12 17:02:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:32,300 INFO L225 Difference]: With dead ends: 2632 [2022-07-12 17:02:32,300 INFO L226 Difference]: Without dead ends: 2630 [2022-07-12 17:02:32,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-07-12 17:02:32,302 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 3132 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 6353 mSolverCounterSat, 2708 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3132 SdHoareTripleChecker+Valid, 3546 SdHoareTripleChecker+Invalid, 9063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2708 IncrementalHoareTripleChecker+Valid, 6353 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:32,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3132 Valid, 3546 Invalid, 9063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2708 Valid, 6353 Invalid, 2 Unknown, 0 Unchecked, 14.7s Time] [2022-07-12 17:02:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2022-07-12 17:02:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2352. [2022-07-12 17:02:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 1607 states have (on average 1.2047293092719353) internal successors, (1936), 1649 states have internal predecessors, (1936), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:02:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3139 transitions. [2022-07-12 17:02:32,441 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3139 transitions. Word has length 189 [2022-07-12 17:02:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:32,441 INFO L495 AbstractCegarLoop]: Abstraction has 2352 states and 3139 transitions. [2022-07-12 17:02:32,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-12 17:02:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3139 transitions. [2022-07-12 17:02:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 17:02:32,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:32,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:02:32,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 17:02:32,445 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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 27 more)] === [2022-07-12 17:02:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash 308324374, now seen corresponding path program 1 times [2022-07-12 17:02:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:32,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289928722] [2022-07-12 17:02:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:32,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:02:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:02:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:02:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:02:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:02:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:02:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:02:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:02:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:02:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:02:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:02:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:02:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:02:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:02:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:02:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:02:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:02:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:02:32,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:32,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289928722] [2022-07-12 17:02:32,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289928722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:32,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:32,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:02:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004646961] [2022-07-12 17:02:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:32,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:02:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:02:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:02:32,620 INFO L87 Difference]: Start difference. First operand 2352 states and 3139 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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) [2022-07-12 17:02:34,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:36,974 INFO L93 Difference]: Finished difference Result 2352 states and 3139 transitions. [2022-07-12 17:02:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:02:36,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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 168 [2022-07-12 17:02:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:36,981 INFO L225 Difference]: With dead ends: 2352 [2022-07-12 17:02:36,981 INFO L226 Difference]: Without dead ends: 2350 [2022-07-12 17:02:36,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:36,983 INFO L413 NwaCegarLoop]: 1380 mSDtfsCounter, 2537 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2619 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:36,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2619 Valid, 2190 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1643 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 17:02:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2022-07-12 17:02:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2022-07-12 17:02:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 1606 states have (on average 1.2042341220423411) internal successors, (1934), 1647 states have internal predecessors, (1934), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:02:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3137 transitions. [2022-07-12 17:02:37,123 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3137 transitions. Word has length 168 [2022-07-12 17:02:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:37,124 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3137 transitions. [2022-07-12 17:02:37,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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) [2022-07-12 17:02:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3137 transitions. [2022-07-12 17:02:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-12 17:02:37,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:37,128 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:02:37,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 17:02:37,128 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 27 more)] === [2022-07-12 17:02:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:37,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1078103048, now seen corresponding path program 1 times [2022-07-12 17:02:37,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:37,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268568193] [2022-07-12 17:02:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:37,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:02:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:02:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:02:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:02:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:02:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:02:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:02:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:02:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:02:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:02:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:02:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:02:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:02:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:02:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:02:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:02:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:02:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:02:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:02:37,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:37,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268568193] [2022-07-12 17:02:37,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268568193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:37,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:37,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:02:37,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575631177] [2022-07-12 17:02:37,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:37,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:02:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:37,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:02:37,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:02:37,394 INFO L87 Difference]: Start difference. First operand 2350 states and 3137 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2022-07-12 17:02:38,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:40,684 INFO L93 Difference]: Finished difference Result 2350 states and 3137 transitions. [2022-07-12 17:02:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:02:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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 174 [2022-07-12 17:02:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:40,690 INFO L225 Difference]: With dead ends: 2350 [2022-07-12 17:02:40,690 INFO L226 Difference]: Without dead ends: 2348 [2022-07-12 17:02:40,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:40,691 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 2531 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:40,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 2188 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 17:02:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2022-07-12 17:02:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2022-07-12 17:02:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 1605 states have (on average 1.2037383177570093) internal successors, (1932), 1645 states have internal predecessors, (1932), 574 states have call successors, (574), 160 states have call predecessors, (574), 163 states have return successors, (629), 569 states have call predecessors, (629), 572 states have call successors, (629) [2022-07-12 17:02:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3135 transitions. [2022-07-12 17:02:40,810 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3135 transitions. Word has length 174 [2022-07-12 17:02:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:40,811 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 3135 transitions. [2022-07-12 17:02:40,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2022-07-12 17:02:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3135 transitions. [2022-07-12 17:02:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 17:02:40,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:40,815 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:02:40,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 17:02:40,815 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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 27 more)] === [2022-07-12 17:02:40,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1433403608, now seen corresponding path program 1 times [2022-07-12 17:02:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:40,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502972208] [2022-07-12 17:02:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:02:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:02:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:02:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:02:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:02:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:02:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:02:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:02:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:02:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:02:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:02:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:02:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:02:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:02:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:02:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:02:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:02:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:02:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 17:02:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:02:41,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:41,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502972208] [2022-07-12 17:02:41,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502972208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:41,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:41,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:02:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953254851] [2022-07-12 17:02:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:41,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:02:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:02:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:02:41,017 INFO L87 Difference]: Start difference. First operand 2348 states and 3135 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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) [2022-07-12 17:02:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:44,098 INFO L93 Difference]: Finished difference Result 2348 states and 3135 transitions. [2022-07-12 17:02:44,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:02:44,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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 180 [2022-07-12 17:02:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:44,104 INFO L225 Difference]: With dead ends: 2348 [2022-07-12 17:02:44,105 INFO L226 Difference]: Without dead ends: 2192 [2022-07-12 17:02:44,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:44,107 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 2522 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:44,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 2187 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 17:02:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-07-12 17:02:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2192. [2022-07-12 17:02:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 1511 states have (on average 1.213765718067505) internal successors, (1834), 1548 states have internal predecessors, (1834), 533 states have call successors, (533), 140 states have call predecessors, (533), 143 states have return successors, (588), 530 states have call predecessors, (588), 531 states have call successors, (588) [2022-07-12 17:02:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2955 transitions. [2022-07-12 17:02:44,221 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2955 transitions. Word has length 180 [2022-07-12 17:02:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:44,222 INFO L495 AbstractCegarLoop]: Abstraction has 2192 states and 2955 transitions. [2022-07-12 17:02:44,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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) [2022-07-12 17:02:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2955 transitions. [2022-07-12 17:02:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-12 17:02:44,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:44,226 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 17:02:44,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 17:02:44,226 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:02:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1420850398, now seen corresponding path program 1 times [2022-07-12 17:02:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:44,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087203334] [2022-07-12 17:02:44,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:44,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:02:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:02:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:02:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:02:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:02:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:02:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:02:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:02:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:02:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:02:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:02:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:02:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:02:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 17:02:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:02:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 17:02:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 17:02:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:02:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:02:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 17:02:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-12 17:02:44,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:44,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087203334] [2022-07-12 17:02:44,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087203334] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:02:44,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734596794] [2022-07-12 17:02:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:44,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:02:44,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:02:44,624 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) [2022-07-12 17:02:44,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 17:02:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:45,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 2373 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 17:02:45,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:02:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-12 17:02:45,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:02:45,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734596794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:45,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:02:45,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 10 [2022-07-12 17:02:45,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653568745] [2022-07-12 17:02:45,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:45,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:02:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:45,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:02:45,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:02:45,326 INFO L87 Difference]: Start difference. First operand 2192 states and 2955 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:02:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:46,386 INFO L93 Difference]: Finished difference Result 4383 states and 5978 transitions. [2022-07-12 17:02:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:02:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 205 [2022-07-12 17:02:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:46,395 INFO L225 Difference]: With dead ends: 4383 [2022-07-12 17:02:46,395 INFO L226 Difference]: Without dead ends: 2210 [2022-07-12 17:02:46,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:02:46,405 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 7 mSDsluCounter, 5651 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7068 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:46,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7068 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 17:02:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2022-07-12 17:02:46,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2203. [2022-07-12 17:02:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 1520 states have (on average 1.2125) internal successors, (1843), 1557 states have internal predecessors, (1843), 533 states have call successors, (533), 140 states have call predecessors, (533), 145 states have return successors, (593), 532 states have call predecessors, (593), 531 states have call successors, (593) [2022-07-12 17:02:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 2969 transitions. [2022-07-12 17:02:46,557 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 2969 transitions. Word has length 205 [2022-07-12 17:02:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:46,557 INFO L495 AbstractCegarLoop]: Abstraction has 2203 states and 2969 transitions. [2022-07-12 17:02:46,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:02:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2969 transitions. [2022-07-12 17:02:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-12 17:02:46,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:46,561 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 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, 1, 1, 1, 1] [2022-07-12 17:02:46,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 17:02:46,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 17:02:46,768 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:02:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1268282682, now seen corresponding path program 1 times [2022-07-12 17:02:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:46,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43443383] [2022-07-12 17:02:46,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:02:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:02:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:02:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:02:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:02:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:02:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 17:02:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:02:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:02:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:02:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:02:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:02:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:02:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:02:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 17:02:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 17:02:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 17:02:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:02:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:02:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 17:02:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 17:02:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:02:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 17:02:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 17:02:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 17:02:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 17:02:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:02:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-12 17:02:47,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:47,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43443383] [2022-07-12 17:02:47,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43443383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:47,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:47,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 17:02:47,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737664405] [2022-07-12 17:02:47,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:47,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:02:47,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:47,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:02:47,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:02:47,096 INFO L87 Difference]: Start difference. First operand 2203 states and 2969 transitions. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-12 17:02:52,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:56,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:03:04,757 INFO L93 Difference]: Finished difference Result 2967 states and 4184 transitions. [2022-07-12 17:03:04,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 17:03:04,758 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 213 [2022-07-12 17:03:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:03:04,765 INFO L225 Difference]: With dead ends: 2967 [2022-07-12 17:03:04,766 INFO L226 Difference]: Without dead ends: 2558 [2022-07-12 17:03:04,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-07-12 17:03:04,768 INFO L413 NwaCegarLoop]: 1243 mSDtfsCounter, 2289 mSDsluCounter, 3586 mSDsCounter, 0 mSdLazyCounter, 10975 mSolverCounterSat, 1983 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 4829 SdHoareTripleChecker+Invalid, 12959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1983 IncrementalHoareTripleChecker+Valid, 10975 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:03:04,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 4829 Invalid, 12959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1983 Valid, 10975 Invalid, 1 Unknown, 0 Unchecked, 17.2s Time] [2022-07-12 17:03:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2022-07-12 17:03:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2223. [2022-07-12 17:03:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1534 states have (on average 1.2105606258148631) internal successors, (1857), 1571 states have internal predecessors, (1857), 535 states have call successors, (535), 140 states have call predecessors, (535), 149 states have return successors, (619), 538 states have call predecessors, (619), 533 states have call successors, (619) [2022-07-12 17:03:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3011 transitions. [2022-07-12 17:03:04,916 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3011 transitions. Word has length 213 [2022-07-12 17:03:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:03:04,916 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 3011 transitions. [2022-07-12 17:03:04,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-12 17:03:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3011 transitions. [2022-07-12 17:03:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 17:03:04,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:03:04,920 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:03:04,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 17:03:04,920 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:03:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:03:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1760355408, now seen corresponding path program 1 times [2022-07-12 17:03:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:03:04,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152205194] [2022-07-12 17:03:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:03:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:03:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:03:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:03:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:03:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:03:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:03:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:03:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:03:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:03:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 17:03:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:03:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:03:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:03:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:03:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:03:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:03:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:03:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 17:03:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 17:03:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 17:03:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:03:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:03:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 17:03:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 17:03:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:03:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 17:03:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:03:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 17:03:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:03:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:03:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-12 17:03:05,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:03:05,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152205194] [2022-07-12 17:03:05,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152205194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:03:05,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:03:05,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 17:03:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813745155] [2022-07-12 17:03:05,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:03:05,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:03:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:03:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:03:05,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:03:05,315 INFO L87 Difference]: Start difference. First operand 2223 states and 3011 transitions. Second operand has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-12 17:03:09,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:11,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:13,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:14,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:16,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:18,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:03:27,825 INFO L93 Difference]: Finished difference Result 2870 states and 4018 transitions. [2022-07-12 17:03:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 17:03:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) Word has length 221 [2022-07-12 17:03:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:03:27,833 INFO L225 Difference]: With dead ends: 2870 [2022-07-12 17:03:27,833 INFO L226 Difference]: Without dead ends: 2441 [2022-07-12 17:03:27,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2022-07-12 17:03:27,835 INFO L413 NwaCegarLoop]: 1250 mSDtfsCounter, 1845 mSDsluCounter, 3840 mSDsCounter, 0 mSdLazyCounter, 11687 mSolverCounterSat, 1544 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 5090 SdHoareTripleChecker+Invalid, 13233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1544 IncrementalHoareTripleChecker+Valid, 11687 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:03:27,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 5090 Invalid, 13233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1544 Valid, 11687 Invalid, 2 Unknown, 0 Unchecked, 22.0s Time] [2022-07-12 17:03:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2022-07-12 17:03:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2223. [2022-07-12 17:03:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1535 states have (on average 1.2104234527687296) internal successors, (1858), 1570 states have internal predecessors, (1858), 535 states have call successors, (535), 140 states have call predecessors, (535), 148 states have return successors, (617), 538 states have call predecessors, (617), 533 states have call successors, (617) [2022-07-12 17:03:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3010 transitions. [2022-07-12 17:03:27,984 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3010 transitions. Word has length 221 [2022-07-12 17:03:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:03:27,985 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 3010 transitions. [2022-07-12 17:03:27,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-12 17:03:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3010 transitions. [2022-07-12 17:03:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 17:03:27,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:03:27,989 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-12 17:03:27,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 17:03:27,990 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:03:27,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:03:27,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1284645112, now seen corresponding path program 1 times [2022-07-12 17:03:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:03:27,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50053130] [2022-07-12 17:03:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:03:27,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:03:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:03:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:03:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:03:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:03:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:03:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:03:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:03:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:03:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:03:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:03:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:03:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:03:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:03:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:03:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:03:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:03:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:03:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 17:03:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 17:03:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:03:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 17:03:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:03:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:03:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:03:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:03:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 17:03:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:03:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-07-12 17:03:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:03:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50053130] [2022-07-12 17:03:28,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50053130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:03:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293899360] [2022-07-12 17:03:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:03:28,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:03:28,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:03:28,356 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) [2022-07-12 17:03:28,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 17:03:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:03:28,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 17:03:28,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:03:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 99 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-12 17:03:29,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:03:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-07-12 17:03:29,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293899360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:03:29,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 17:03:29,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2022-07-12 17:03:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945690802] [2022-07-12 17:03:29,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 17:03:29,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 17:03:29,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:03:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 17:03:29,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2022-07-12 17:03:29,574 INFO L87 Difference]: Start difference. First operand 2223 states and 3010 transitions. Second operand has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) [2022-07-12 17:03:34,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:36,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:38,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:40,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:43,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:45,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:47,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:49,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:03:52,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:04,703 INFO L93 Difference]: Finished difference Result 4542 states and 6305 transitions. [2022-07-12 17:04:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 17:04:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) Word has length 221 [2022-07-12 17:04:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:04,711 INFO L225 Difference]: With dead ends: 4542 [2022-07-12 17:04:04,711 INFO L226 Difference]: Without dead ends: 2336 [2022-07-12 17:04:04,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 17:04:04,719 INFO L413 NwaCegarLoop]: 1299 mSDtfsCounter, 1995 mSDsluCounter, 5893 mSDsCounter, 0 mSdLazyCounter, 18094 mSolverCounterSat, 1370 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 7192 SdHoareTripleChecker+Invalid, 19467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1370 IncrementalHoareTripleChecker+Valid, 18094 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:04,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2060 Valid, 7192 Invalid, 19467 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1370 Valid, 18094 Invalid, 3 Unknown, 0 Unchecked, 34.5s Time] [2022-07-12 17:04:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2022-07-12 17:04:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2237. [2022-07-12 17:04:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 1545 states have (on average 1.2084142394822006) internal successors, (1867), 1578 states have internal predecessors, (1867), 536 states have call successors, (536), 140 states have call predecessors, (536), 151 states have return successors, (624), 543 states have call predecessors, (624), 534 states have call successors, (624) [2022-07-12 17:04:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3027 transitions. [2022-07-12 17:04:04,881 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3027 transitions. Word has length 221 [2022-07-12 17:04:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:04,882 INFO L495 AbstractCegarLoop]: Abstraction has 2237 states and 3027 transitions. [2022-07-12 17:04:04,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) [2022-07-12 17:04:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3027 transitions. [2022-07-12 17:04:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-07-12 17:04:04,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:04,887 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:04:04,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 17:04:05,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 17:04:05,100 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash 89445841, now seen corresponding path program 1 times [2022-07-12 17:04:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:05,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036119929] [2022-07-12 17:04:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:04:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:04:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 17:04:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:04:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:04:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:04:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:04:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 17:04:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 17:04:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 17:04:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 17:04:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 17:04:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 17:04:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:04:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:04:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:04:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 17:04:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:04:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:04:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 17:04:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-12 17:04:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-12 17:04:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-12 17:04:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-07-12 17:04:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-07-12 17:04:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2022-07-12 17:04:05,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:05,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036119929] [2022-07-12 17:04:05,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036119929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:04:05,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805764514] [2022-07-12 17:04:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:05,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:04:05,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:04:05,789 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) [2022-07-12 17:04:05,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 17:04:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:06,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 17:04:06,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:04:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-07-12 17:04:06,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:04:06,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805764514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:06,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:04:06,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 28 [2022-07-12 17:04:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924340999] [2022-07-12 17:04:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:06,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:04:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:06,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:04:06,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2022-07-12 17:04:06,767 INFO L87 Difference]: Start difference. First operand 2237 states and 3027 transitions. Second operand has 15 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 6 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (42), 7 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-12 17:04:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:07,507 INFO L93 Difference]: Finished difference Result 4568 states and 6198 transitions. [2022-07-12 17:04:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 17:04:07,507 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 6 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (42), 7 states have call predecessors, (42), 6 states have call successors, (42) Word has length 326 [2022-07-12 17:04:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:07,514 INFO L225 Difference]: With dead ends: 4568 [2022-07-12 17:04:07,514 INFO L226 Difference]: Without dead ends: 2463 [2022-07-12 17:04:07,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 17:04:07,521 INFO L413 NwaCegarLoop]: 1509 mSDtfsCounter, 438 mSDsluCounter, 18979 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 20488 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:07,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 20488 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 17:04:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2022-07-12 17:04:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2271. [2022-07-12 17:04:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2271 states, 1569 states have (on average 1.2052262587635436) internal successors, (1891), 1602 states have internal predecessors, (1891), 544 states have call successors, (544), 140 states have call predecessors, (544), 153 states have return successors, (636), 553 states have call predecessors, (636), 542 states have call successors, (636) [2022-07-12 17:04:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 3071 transitions. [2022-07-12 17:04:07,662 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 3071 transitions. Word has length 326 [2022-07-12 17:04:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:07,662 INFO L495 AbstractCegarLoop]: Abstraction has 2271 states and 3071 transitions. [2022-07-12 17:04:07,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 6 states have call successors, (45), 2 states have call predecessors, (45), 5 states have return successors, (42), 7 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-12 17:04:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 3071 transitions. [2022-07-12 17:04:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-12 17:04:07,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:07,666 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 17:04:07,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 17:04:07,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:04:07,876 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1038366459, now seen corresponding path program 1 times [2022-07-12 17:04:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:07,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953860948] [2022-07-12 17:04:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:04:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:04:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 17:04:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:04:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:04:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:04:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:04:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:04:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 17:04:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:04:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 17:04:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:04:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:04:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:04:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:04:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2022-07-12 17:04:08,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:08,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953860948] [2022-07-12 17:04:08,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953860948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:04:08,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6038788] [2022-07-12 17:04:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:04:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:04:08,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:04:08,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 17:04:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:09,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-12 17:04:09,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:04:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-12 17:04:09,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:04:09,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6038788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:09,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:04:09,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 15 [2022-07-12 17:04:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732910307] [2022-07-12 17:04:09,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:09,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:04:09,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:09,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:04:09,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:04:09,412 INFO L87 Difference]: Start difference. First operand 2271 states and 3071 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-12 17:04:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:09,651 INFO L93 Difference]: Finished difference Result 4536 states and 6208 transitions. [2022-07-12 17:04:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:04:09,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) Word has length 257 [2022-07-12 17:04:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:09,659 INFO L225 Difference]: With dead ends: 4536 [2022-07-12 17:04:09,660 INFO L226 Difference]: Without dead ends: 2284 [2022-07-12 17:04:09,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 336 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-12 17:04:09,669 INFO L413 NwaCegarLoop]: 1411 mSDtfsCounter, 5 mSDsluCounter, 9864 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11275 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:09,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11275 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:04:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2022-07-12 17:04:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2280. [2022-07-12 17:04:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 1577 states have (on average 1.2035510462904249) internal successors, (1898), 1608 states have internal predecessors, (1898), 544 states have call successors, (544), 140 states have call predecessors, (544), 154 states have return successors, (638), 556 states have call predecessors, (638), 542 states have call successors, (638) [2022-07-12 17:04:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3080 transitions. [2022-07-12 17:04:09,806 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3080 transitions. Word has length 257 [2022-07-12 17:04:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:09,807 INFO L495 AbstractCegarLoop]: Abstraction has 2280 states and 3080 transitions. [2022-07-12 17:04:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-12 17:04:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3080 transitions. [2022-07-12 17:04:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-12 17:04:09,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:09,811 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 17:04:09,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 17:04:10,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:04:10,036 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash 285054599, now seen corresponding path program 2 times [2022-07-12 17:04:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:10,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034378259] [2022-07-12 17:04:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:04:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:04:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 17:04:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:04:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:04:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:04:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:04:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:04:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 17:04:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:04:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 17:04:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:04:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:04:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:04:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-12 17:04:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-07-12 17:04:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034378259] [2022-07-12 17:04:10,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034378259] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:04:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661046064] [2022-07-12 17:04:10,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 17:04:10,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:04:10,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:04:10,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:04:10,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 17:04:11,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 17:04:11,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:04:11,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 17:04:11,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:04:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2022-07-12 17:04:11,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:04:11,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661046064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:11,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:04:11,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 16 [2022-07-12 17:04:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345837078] [2022-07-12 17:04:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:11,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:04:11,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:04:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:04:11,528 INFO L87 Difference]: Start difference. First operand 2280 states and 3080 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 8 states have internal predecessors, (106), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 5 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-12 17:04:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:11,780 INFO L93 Difference]: Finished difference Result 4150 states and 5637 transitions. [2022-07-12 17:04:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:04:11,780 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 8 states have internal predecessors, (106), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 5 states have call predecessors, (34), 3 states have call successors, (34) Word has length 257 [2022-07-12 17:04:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:11,787 INFO L225 Difference]: With dead ends: 4150 [2022-07-12 17:04:11,787 INFO L226 Difference]: Without dead ends: 1889 [2022-07-12 17:04:11,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 333 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-07-12 17:04:11,796 INFO L413 NwaCegarLoop]: 1414 mSDtfsCounter, 10 mSDsluCounter, 11269 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12683 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:11,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12683 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:04:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-07-12 17:04:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1877. [2022-07-12 17:04:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1298 states have (on average 1.1887519260400616) internal successors, (1543), 1321 states have internal predecessors, (1543), 435 states have call successors, (435), 126 states have call predecessors, (435), 139 states have return successors, (519), 447 states have call predecessors, (519), 433 states have call successors, (519) [2022-07-12 17:04:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2497 transitions. [2022-07-12 17:04:11,923 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2497 transitions. Word has length 257 [2022-07-12 17:04:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:11,923 INFO L495 AbstractCegarLoop]: Abstraction has 1877 states and 2497 transitions. [2022-07-12 17:04:11,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 8 states have internal predecessors, (106), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 5 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-12 17:04:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2497 transitions. [2022-07-12 17:04:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-12 17:04:11,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:11,927 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 17:04:11,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 17:04:12,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:04:12,144 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash 794527689, now seen corresponding path program 1 times [2022-07-12 17:04:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:12,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385195050] [2022-07-12 17:04:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:04:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:04:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:04:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:04:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 17:04:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:04:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:04:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:04:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:04:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:04:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:04:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 17:04:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 17:04:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 17:04:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:04:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:04:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 17:04:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:04:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:04:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:04:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-12 17:04:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2022-07-12 17:04:12,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:12,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385195050] [2022-07-12 17:04:12,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385195050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:12,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:12,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 17:04:12,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651091110] [2022-07-12 17:04:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:12,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 17:04:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 17:04:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:04:12,556 INFO L87 Difference]: Start difference. First operand 1877 states and 2497 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-12 17:04:15,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:16,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:18,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:24,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:28,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:34,427 INFO L93 Difference]: Finished difference Result 3427 states and 4856 transitions. [2022-07-12 17:04:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 17:04:34,427 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 257 [2022-07-12 17:04:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:34,437 INFO L225 Difference]: With dead ends: 3427 [2022-07-12 17:04:34,437 INFO L226 Difference]: Without dead ends: 3425 [2022-07-12 17:04:34,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=781, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 17:04:34,439 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 6474 mSDsluCounter, 3777 mSDsCounter, 0 mSdLazyCounter, 11629 mSolverCounterSat, 4842 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6547 SdHoareTripleChecker+Valid, 5739 SdHoareTripleChecker+Invalid, 16473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4842 IncrementalHoareTripleChecker+Valid, 11629 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:34,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6547 Valid, 5739 Invalid, 16473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4842 Valid, 11629 Invalid, 2 Unknown, 0 Unchecked, 21.2s Time] [2022-07-12 17:04:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2022-07-12 17:04:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3302. [2022-07-12 17:04:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 2287 states have (on average 1.205509400961959) internal successors, (2757), 2331 states have internal predecessors, (2757), 794 states have call successors, (794), 196 states have call predecessors, (794), 216 states have return successors, (996), 811 states have call predecessors, (996), 792 states have call successors, (996) [2022-07-12 17:04:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4547 transitions. [2022-07-12 17:04:34,684 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4547 transitions. Word has length 257 [2022-07-12 17:04:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:34,685 INFO L495 AbstractCegarLoop]: Abstraction has 3302 states and 4547 transitions. [2022-07-12 17:04:34,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-12 17:04:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4547 transitions. [2022-07-12 17:04:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-12 17:04:34,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:34,688 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:04:34,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 17:04:34,689 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 17:04:34,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash 270197285, now seen corresponding path program 1 times [2022-07-12 17:04:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:34,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910596783] [2022-07-12 17:04:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:34,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat