./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 791161d1 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-?-791161d [2022-07-23 04:17:31,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:17:31,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:17:31,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:17:31,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:17:31,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:17:31,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:17:31,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:17:31,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:17:31,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:17:31,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:17:31,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:17:31,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:17:31,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:17:31,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:17:31,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:17:31,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:17:31,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:17:31,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:17:31,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:17:31,431 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:17:31,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:17:31,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:17:31,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:17:31,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:17:31,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:17:31,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:17:31,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:17:31,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:17:31,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:17:31,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:17:31,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:17:31,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:17:31,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:17:31,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:17:31,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:17:31,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:17:31,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:17:31,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:17:31,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:17:31,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:17:31,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:17:31,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:17:31,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:17:31,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:17:31,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:17:31,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:17:31,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:17:31,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:17:31,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:17:31,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:17:31,481 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:17:31,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:17:31,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:17:31,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:17:31,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:17:31,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:17:31,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:17:31,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:17:31,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:17:31,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:17:31,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:17:31,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:17:31,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:17:31,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:17:31,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:17:31,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:17:31,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:17:31,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:17:31,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:17:31,485 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:17:31,485 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:17:31,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:17:31,486 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-23 04:17:31,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:17:31,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:17:31,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:17:31,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:17:31,731 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:17:31,732 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-23 04:17:31,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a149c9c6c/cfacca54f6e044948332503d349aa443/FLAGd67d5be71 [2022-07-23 04:17:32,422 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:17:32,423 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-23 04:17:32,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a149c9c6c/cfacca54f6e044948332503d349aa443/FLAGd67d5be71 [2022-07-23 04:17:32,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a149c9c6c/cfacca54f6e044948332503d349aa443 [2022-07-23 04:17:32,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:17:32,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:17:32,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:17:32,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:17:32,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:17:32,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:17:32" (1/1) ... [2022-07-23 04:17:32,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec8f483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:32, skipping insertion in model container [2022-07-23 04:17:32,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:17:32" (1/1) ... [2022-07-23 04:17:32,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:17:32,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:17:34,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:34,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:17:35,026 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:17:35,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:17:35,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2022-07-23 04:17:35,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408620,408633] [2022-07-23 04:17:35,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408770,408783] [2022-07-23 04:17:35,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408917,408930] [2022-07-23 04:17:35,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409068,409081] [2022-07-23 04:17:35,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409219,409232] [2022-07-23 04:17:35,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409367,409380] [2022-07-23 04:17:35,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2022-07-23 04:17:35,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2022-07-23 04:17:35,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2022-07-23 04:17:35,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2022-07-23 04:17:35,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2022-07-23 04:17:35,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2022-07-23 04:17:35,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410495,410508] [2022-07-23 04:17:35,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410665,410678] [2022-07-23 04:17:35,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410827,410840] [2022-07-23 04:17:35,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:17:35,533 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:17:35,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35 WrapperNode [2022-07-23 04:17:35,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:17:35,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:17:35,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:17:35,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:17:35,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,759 INFO L137 Inliner]: procedures = 641, calls = 2563, calls flagged for inlining = 300, calls inlined = 195, statements flattened = 3322 [2022-07-23 04:17:35,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:17:35,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:17:35,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:17:35,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:17:35,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:17:35,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:17:35,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:17:35,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:17:35,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (1/1) ... [2022-07-23 04:17:35,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:17:35,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:17:35,941 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-23 04:17:35,975 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-23 04:17:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:17:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:17:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_open [2022-07-23 04:17:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_open [2022-07-23 04:17:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:17:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:17:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:17:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:17:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-23 04:17:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-23 04:17:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:17:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:17:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-07-23 04:17:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-07-23 04:17:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-23 04:17:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-23 04:17:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2022-07-23 04:17:35,998 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2022-07-23 04:17:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:17:35,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:17:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:17:35,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:17:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-23 04:17:35,998 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-23 04:17:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_reset_module [2022-07-23 04:17:35,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_reset_module [2022-07-23 04:17:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_bus_state [2022-07-23 04:17:35,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_bus_state [2022-07-23 04:17:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:17:35,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:17:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:17:35,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:17:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:17:35,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:17:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-23 04:17:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-23 04:17:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:17:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_buserror [2022-07-23 04:17:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_buserror [2022-07-23 04:17:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:17:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:17:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-23 04:17:36,001 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-23 04:17:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 04:17:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_remove [2022-07-23 04:17:36,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_remove [2022-07-23 04:17:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-23 04:17:36,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-23 04:17:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 04:17:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:17:36,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:17:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:17:36,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:17:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:17:36,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:17:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:17:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:17:36,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:17:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 04:17:36,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 04:17:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:17:36,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:17:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 04:17:36,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 04:17:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_txok [2022-07-23 04:17:36,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_txok [2022-07-23 04:17:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_termination [2022-07-23 04:17:36,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_termination [2022-07-23 04:17:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_msg [2022-07-23 04:17:36,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_msg [2022-07-23 04:17:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_page [2022-07-23 04:17:36,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_page [2022-07-23 04:17:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:17:36,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:17:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:17:36,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:17:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:17:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_inquiry [2022-07-23 04:17:36,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_inquiry [2022-07-23 04:17:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:17:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:17:36,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:17:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:17:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:17:36,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:17:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:17:36,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:17:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2022-07-23 04:17:36,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2022-07-23 04:17:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure napi_disable [2022-07-23 04:17:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_disable [2022-07-23 04:17:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-23 04:17:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-23 04:17:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:17:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:17:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-07-23 04:17:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-07-23 04:17:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:17:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:17:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 04:17:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 04:17:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:17:36,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:17:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_fromio [2022-07-23 04:17:36,011 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_fromio [2022-07-23 04:17:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:17:36,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:17:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-07-23 04:17:36,011 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-07-23 04:17:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_stop [2022-07-23 04:17:36,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_stop [2022-07-23 04:17:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 04:17:36,012 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 04:17:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-23 04:17:36,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-23 04:17:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-23 04:17:36,012 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-23 04:17:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_127 [2022-07-23 04:17:36,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_127 [2022-07-23 04:17:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:17:36,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:17:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:17:36,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:17:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:17:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:17:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:17:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:17:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-07-23 04:17:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-07-23 04:17:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_probe [2022-07-23 04:17:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_probe [2022-07-23 04:17:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:17:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-07-23 04:17:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-07-23 04:17:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-07-23 04:17:36,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-07-23 04:17:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:17:36,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:17:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-23 04:17:36,015 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-23 04:17:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2022-07-23 04:17:36,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2022-07-23 04:17:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:17:36,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:17:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-07-23 04:17:36,016 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-07-23 04:17:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-23 04:17:36,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-23 04:17:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:17:36,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:17:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:17:36,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:17:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:17:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:17:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-23 04:17:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-23 04:17:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:17:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:17:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:17:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:17:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:17:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:17:36,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:17:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:17:36,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:17:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:17:36,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:17:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:17:36,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:17:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:17:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-23 04:17:36,018 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-23 04:17:36,575 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:17:36,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:17:36,711 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:17:38,882 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:17:38,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:17:38,892 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 04:17:38,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:17:38 BoogieIcfgContainer [2022-07-23 04:17:38,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:17:38,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:17:38,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:17:38,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:17:38,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:17:32" (1/3) ... [2022-07-23 04:17:38,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324f8bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:17:38, skipping insertion in model container [2022-07-23 04:17:38,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:17:35" (2/3) ... [2022-07-23 04:17:38,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324f8bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:17:38, skipping insertion in model container [2022-07-23 04:17:38,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:17:38" (3/3) ... [2022-07-23 04:17:38,900 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-07-23 04:17:38,909 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:17:38,910 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-23 04:17:38,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:17:38,971 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@78348984, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b3b06d0 [2022-07-23 04:17:38,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-23 04:17:38,978 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-23 04:17:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 04:17:38,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:38,985 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-23 04:17:38,985 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-23 04:17:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 449709992, now seen corresponding path program 1 times [2022-07-23 04:17:38,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:38,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740581677] [2022-07-23 04:17:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:17:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:17:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:17:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:17:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:17:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:17:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:39,537 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-23 04:17:39,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:39,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740581677] [2022-07-23 04:17:39,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740581677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:39,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:39,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:17:39,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177178652] [2022-07-23 04:17:39,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:39,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:17:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:39,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:17:39,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:17:39,570 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-23 04:17:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:17:45,740 INFO L93 Difference]: Finished difference Result 3717 states and 5232 transitions. [2022-07-23 04:17:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:17:45,742 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-23 04:17:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:17:45,766 INFO L225 Difference]: With dead ends: 3717 [2022-07-23 04:17:45,766 INFO L226 Difference]: Without dead ends: 2453 [2022-07-23 04:17:45,776 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-23 04:17:45,778 INFO L413 NwaCegarLoop]: 2008 mSDtfsCounter, 3532 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 4161 mSolverCounterSat, 2167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:17:45,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3609 Valid, 3209 Invalid, 6328 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2167 Valid, 4161 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-23 04:17:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2022-07-23 04:17:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2254. [2022-07-23 04:17:45,946 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-23 04:17:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3020 transitions. [2022-07-23 04:17:45,963 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3020 transitions. Word has length 64 [2022-07-23 04:17:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:17:45,964 INFO L495 AbstractCegarLoop]: Abstraction has 2254 states and 3020 transitions. [2022-07-23 04:17:45,964 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-23 04:17:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3020 transitions. [2022-07-23 04:17:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 04:17:45,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:45,966 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-23 04:17:45,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:17:45,967 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-23 04:17:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash -733384379, now seen corresponding path program 1 times [2022-07-23 04:17:45,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:45,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982014767] [2022-07-23 04:17:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:17:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:17:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:17:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:17:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:17:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:17:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:17:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:46,228 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-23 04:17:46,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:46,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982014767] [2022-07-23 04:17:46,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982014767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:46,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:46,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:17:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313942058] [2022-07-23 04:17:46,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:46,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:17:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:46,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:17:46,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:17:46,232 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-23 04:17:48,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:17:50,183 INFO L93 Difference]: Finished difference Result 2254 states and 3020 transitions. [2022-07-23 04:17:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:17:50,184 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-23 04:17:50,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:17:50,195 INFO L225 Difference]: With dead ends: 2254 [2022-07-23 04:17:50,196 INFO L226 Difference]: Without dead ends: 2252 [2022-07-23 04:17:50,197 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-23 04:17:50,199 INFO L413 NwaCegarLoop]: 1428 mSDtfsCounter, 2661 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:17:50,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2759 Valid, 2266 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-23 04:17:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2022-07-23 04:17:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2252. [2022-07-23 04:17:50,255 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-23 04:17:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3018 transitions. [2022-07-23 04:17:50,269 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3018 transitions. Word has length 70 [2022-07-23 04:17:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:17:50,270 INFO L495 AbstractCegarLoop]: Abstraction has 2252 states and 3018 transitions. [2022-07-23 04:17:50,270 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-23 04:17:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3018 transitions. [2022-07-23 04:17:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 04:17:50,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:50,276 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-23 04:17:50,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:17:50,276 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-23 04:17:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:50,277 INFO L85 PathProgramCache]: Analyzing trace with hash -574634998, now seen corresponding path program 1 times [2022-07-23 04:17:50,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12241307] [2022-07-23 04:17:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:50,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:17:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:17:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:17:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:17:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:17:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:17:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:17:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:17:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:50,467 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-23 04:17:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:50,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12241307] [2022-07-23 04:17:50,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12241307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:50,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:50,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:17:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888905090] [2022-07-23 04:17:50,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:50,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:17:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:50,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:17:50,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:17:50,470 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-23 04:17:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:17:53,117 INFO L93 Difference]: Finished difference Result 2252 states and 3018 transitions. [2022-07-23 04:17:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:17:53,118 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-23 04:17:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:17:53,129 INFO L225 Difference]: With dead ends: 2252 [2022-07-23 04:17:53,129 INFO L226 Difference]: Without dead ends: 2250 [2022-07-23 04:17:53,130 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-23 04:17:53,132 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-23 04:17:53,133 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-23 04:17:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2022-07-23 04:17:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2250. [2022-07-23 04:17:53,219 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-23 04:17:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3016 transitions. [2022-07-23 04:17:53,233 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3016 transitions. Word has length 76 [2022-07-23 04:17:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:17:53,233 INFO L495 AbstractCegarLoop]: Abstraction has 2250 states and 3016 transitions. [2022-07-23 04:17:53,234 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-23 04:17:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3016 transitions. [2022-07-23 04:17:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 04:17:53,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:53,236 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-23 04:17:53,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:17:53,236 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-23 04:17:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:53,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1881413847, now seen corresponding path program 1 times [2022-07-23 04:17:53,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:53,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295506010] [2022-07-23 04:17:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:17:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:17:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:17:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:17:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:17:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:17:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:17:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:17:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:17:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,408 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-23 04:17:53,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:53,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295506010] [2022-07-23 04:17:53,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295506010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:53,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:53,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:17:53,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305605870] [2022-07-23 04:17:53,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:53,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:17:53,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:53,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:17:53,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:17:53,411 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-23 04:17:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:17:56,475 INFO L93 Difference]: Finished difference Result 2250 states and 3016 transitions. [2022-07-23 04:17:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:17:56,475 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-23 04:17:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:17:56,485 INFO L225 Difference]: With dead ends: 2250 [2022-07-23 04:17:56,486 INFO L226 Difference]: Without dead ends: 2248 [2022-07-23 04:17:56,486 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-23 04:17:56,487 INFO L413 NwaCegarLoop]: 1424 mSDtfsCounter, 2649 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:17:56,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2745 Valid, 2262 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-23 04:17:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2022-07-23 04:17:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2248. [2022-07-23 04:17:56,537 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-23 04:17:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3014 transitions. [2022-07-23 04:17:56,544 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3014 transitions. Word has length 82 [2022-07-23 04:17:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:17:56,544 INFO L495 AbstractCegarLoop]: Abstraction has 2248 states and 3014 transitions. [2022-07-23 04:17:56,544 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-23 04:17:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3014 transitions. [2022-07-23 04:17:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-23 04:17:56,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:56,546 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-23 04:17:56,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:17:56,547 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-23 04:17:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1455084961, now seen corresponding path program 1 times [2022-07-23 04:17:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:56,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863687895] [2022-07-23 04:17:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:17:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:17:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:17:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:17:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:17:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 04:17:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 04:17:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:56,737 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-23 04:17:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:56,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863687895] [2022-07-23 04:17:56,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863687895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:56,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:56,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:17:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061715127] [2022-07-23 04:17:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:56,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:17:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:56,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:17:56,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:17:56,739 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-23 04:17:59,138 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-23 04:18:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:01,738 INFO L93 Difference]: Finished difference Result 4540 states and 6203 transitions. [2022-07-23 04:18:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:01,739 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-23 04:18:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:01,751 INFO L225 Difference]: With dead ends: 4540 [2022-07-23 04:18:01,751 INFO L226 Difference]: Without dead ends: 2311 [2022-07-23 04:18:01,760 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-23 04:18:01,760 INFO L413 NwaCegarLoop]: 1284 mSDtfsCounter, 3311 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 2264 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3414 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2264 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:01,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3414 Valid, 1992 Invalid, 3712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2264 Valid, 1447 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-07-23 04:18:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-07-23 04:18:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2255. [2022-07-23 04:18:01,852 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-23 04:18:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3045 transitions. [2022-07-23 04:18:01,860 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3045 transitions. Word has length 93 [2022-07-23 04:18:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:01,861 INFO L495 AbstractCegarLoop]: Abstraction has 2255 states and 3045 transitions. [2022-07-23 04:18:01,861 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-23 04:18:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3045 transitions. [2022-07-23 04:18:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 04:18:01,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:01,862 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-23 04:18:01,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:18:01,862 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-23 04:18:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:01,863 INFO L85 PathProgramCache]: Analyzing trace with hash -174515702, now seen corresponding path program 1 times [2022-07-23 04:18:01,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:01,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403307346] [2022-07-23 04:18:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:01,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:02,011 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-23 04:18:02,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:02,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403307346] [2022-07-23 04:18:02,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403307346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:02,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:02,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919961778] [2022-07-23 04:18:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:02,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:02,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:02,014 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-23 04:18:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:04,426 INFO L93 Difference]: Finished difference Result 2255 states and 3045 transitions. [2022-07-23 04:18:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:04,427 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-23 04:18:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:04,443 INFO L225 Difference]: With dead ends: 2255 [2022-07-23 04:18:04,443 INFO L226 Difference]: Without dead ends: 2253 [2022-07-23 04:18:04,444 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-23 04:18:04,445 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 2638 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:04,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 2241 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-23 04:18:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2022-07-23 04:18:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2253. [2022-07-23 04:18:04,506 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-23 04:18:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3043 transitions. [2022-07-23 04:18:04,515 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3043 transitions. Word has length 88 [2022-07-23 04:18:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:04,516 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 3043 transitions. [2022-07-23 04:18:04,516 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-23 04:18:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3043 transitions. [2022-07-23 04:18:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-23 04:18:04,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:04,517 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-23 04:18:04,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:18:04,517 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-23 04:18:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:04,518 INFO L85 PathProgramCache]: Analyzing trace with hash 936118704, now seen corresponding path program 1 times [2022-07-23 04:18:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:04,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064163911] [2022-07-23 04:18:04,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:04,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:18:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:18:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:18:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:18:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 04:18:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 04:18:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:18:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:04,703 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-23 04:18:04,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:04,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064163911] [2022-07-23 04:18:04,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064163911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:18:04,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700098148] [2022-07-23 04:18:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:04,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:18:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:18:04,706 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-23 04:18:04,709 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-23 04:18:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:18:05,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:18:05,229 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-23 04:18:05,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:18:05,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700098148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:05,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:18:05,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-23 04:18:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146730774] [2022-07-23 04:18:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:05,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:18:05,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:05,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:18:05,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:18:05,231 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-23 04:18:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:05,331 INFO L93 Difference]: Finished difference Result 4481 states and 6051 transitions. [2022-07-23 04:18:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:18:05,331 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-23 04:18:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:05,340 INFO L225 Difference]: With dead ends: 4481 [2022-07-23 04:18:05,340 INFO L226 Difference]: Without dead ends: 2247 [2022-07-23 04:18:05,348 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-23 04:18:05,349 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-23 04:18:05,349 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-23 04:18:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-07-23 04:18:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2247. [2022-07-23 04:18:05,429 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-23 04:18:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3034 transitions. [2022-07-23 04:18:05,437 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3034 transitions. Word has length 99 [2022-07-23 04:18:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:05,437 INFO L495 AbstractCegarLoop]: Abstraction has 2247 states and 3034 transitions. [2022-07-23 04:18:05,437 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-23 04:18:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3034 transitions. [2022-07-23 04:18:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 04:18:05,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:05,438 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-23 04:18:05,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 04:18:05,655 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-23 04:18:05,656 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-23 04:18:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash 320510551, now seen corresponding path program 1 times [2022-07-23 04:18:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:05,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341200090] [2022-07-23 04:18:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:05,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:05,789 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-23 04:18:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:05,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341200090] [2022-07-23 04:18:05,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341200090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:05,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:05,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720511068] [2022-07-23 04:18:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:05,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:05,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:05,791 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-23 04:18:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:09,163 INFO L93 Difference]: Finished difference Result 2247 states and 3034 transitions. [2022-07-23 04:18:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:09,164 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-23 04:18:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:09,175 INFO L225 Difference]: With dead ends: 2247 [2022-07-23 04:18:09,175 INFO L226 Difference]: Without dead ends: 2245 [2022-07-23 04:18:09,176 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-23 04:18:09,176 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 2627 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2721 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:09,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2721 Valid, 2220 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 04:18:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2022-07-23 04:18:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2022-07-23 04:18:09,261 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-23 04:18:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3032 transitions. [2022-07-23 04:18:09,268 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3032 transitions. Word has length 94 [2022-07-23 04:18:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:09,269 INFO L495 AbstractCegarLoop]: Abstraction has 2245 states and 3032 transitions. [2022-07-23 04:18:09,269 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-23 04:18:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3032 transitions. [2022-07-23 04:18:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-23 04:18:09,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:09,273 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-23 04:18:09,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 04:18:09,273 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-23 04:18:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 816605428, now seen corresponding path program 1 times [2022-07-23 04:18:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:09,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212531799] [2022-07-23 04:18:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:09,453 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-23 04:18:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:09,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212531799] [2022-07-23 04:18:09,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212531799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:09,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:09,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145881387] [2022-07-23 04:18:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:09,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:09,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:09,456 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-23 04:18:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:11,851 INFO L93 Difference]: Finished difference Result 2245 states and 3032 transitions. [2022-07-23 04:18:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:11,859 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-23 04:18:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:11,868 INFO L225 Difference]: With dead ends: 2245 [2022-07-23 04:18:11,868 INFO L226 Difference]: Without dead ends: 2243 [2022-07-23 04:18:11,869 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-23 04:18:11,870 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 2621 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:11,870 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.3s Time] [2022-07-23 04:18:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2022-07-23 04:18:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2243. [2022-07-23 04:18:11,964 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-23 04:18:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3030 transitions. [2022-07-23 04:18:11,971 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3030 transitions. Word has length 100 [2022-07-23 04:18:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:11,971 INFO L495 AbstractCegarLoop]: Abstraction has 2243 states and 3030 transitions. [2022-07-23 04:18:11,971 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-23 04:18:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3030 transitions. [2022-07-23 04:18:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-23 04:18:11,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:11,974 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-23 04:18:11,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:18:11,974 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-23 04:18:11,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1330511425, now seen corresponding path program 1 times [2022-07-23 04:18:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:11,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465718640] [2022-07-23 04:18:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,150 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-23 04:18:12,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:12,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465718640] [2022-07-23 04:18:12,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465718640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:12,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:12,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497631976] [2022-07-23 04:18:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:12,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:12,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:12,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:12,153 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-23 04:18:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:15,165 INFO L93 Difference]: Finished difference Result 2243 states and 3030 transitions. [2022-07-23 04:18:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:15,166 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-23 04:18:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:15,173 INFO L225 Difference]: With dead ends: 2243 [2022-07-23 04:18:15,173 INFO L226 Difference]: Without dead ends: 2241 [2022-07-23 04:18:15,174 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-23 04:18:15,175 INFO L413 NwaCegarLoop]: 1406 mSDtfsCounter, 2619 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:15,175 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.9s Time] [2022-07-23 04:18:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2022-07-23 04:18:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2022-07-23 04:18:15,245 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-23 04:18:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3028 transitions. [2022-07-23 04:18:15,252 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3028 transitions. Word has length 106 [2022-07-23 04:18:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:15,252 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 3028 transitions. [2022-07-23 04:18:15,252 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-23 04:18:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3028 transitions. [2022-07-23 04:18:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 04:18:15,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:15,254 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-23 04:18:15,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:18:15,254 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-23 04:18:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1278913922, now seen corresponding path program 1 times [2022-07-23 04:18:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:15,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701967140] [2022-07-23 04:18:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:15,405 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-23 04:18:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:15,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701967140] [2022-07-23 04:18:15,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701967140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:15,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:15,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412932960] [2022-07-23 04:18:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:15,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:15,408 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-23 04:18:16,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:18,767 INFO L93 Difference]: Finished difference Result 2241 states and 3028 transitions. [2022-07-23 04:18:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:18,767 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-23 04:18:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:18,775 INFO L225 Difference]: With dead ends: 2241 [2022-07-23 04:18:18,775 INFO L226 Difference]: Without dead ends: 2239 [2022-07-23 04:18:18,776 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-23 04:18:18,776 INFO L413 NwaCegarLoop]: 1404 mSDtfsCounter, 2607 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:18,777 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.2s Time] [2022-07-23 04:18:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2239 states. [2022-07-23 04:18:18,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2239 to 2239. [2022-07-23 04:18:18,848 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-23 04:18:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3026 transitions. [2022-07-23 04:18:18,855 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3026 transitions. Word has length 108 [2022-07-23 04:18:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:18,855 INFO L495 AbstractCegarLoop]: Abstraction has 2239 states and 3026 transitions. [2022-07-23 04:18:18,855 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-23 04:18:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3026 transitions. [2022-07-23 04:18:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 04:18:18,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:18,857 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-23 04:18:18,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:18:18,857 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-23 04:18:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1412026439, now seen corresponding path program 1 times [2022-07-23 04:18:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:18,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381036535] [2022-07-23 04:18:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:18,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,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-23 04:18:19,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:19,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381036535] [2022-07-23 04:18:19,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381036535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:19,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:19,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378182172] [2022-07-23 04:18:19,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:19,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:19,017 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-23 04:18:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:22,052 INFO L93 Difference]: Finished difference Result 2239 states and 3026 transitions. [2022-07-23 04:18:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:22,052 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-23 04:18:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:22,070 INFO L225 Difference]: With dead ends: 2239 [2022-07-23 04:18:22,070 INFO L226 Difference]: Without dead ends: 2237 [2022-07-23 04:18:22,071 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-23 04:18:22,074 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 2603 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:22,074 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.9s Time] [2022-07-23 04:18:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2022-07-23 04:18:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2237. [2022-07-23 04:18:22,153 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-23 04:18:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3024 transitions. [2022-07-23 04:18:22,160 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3024 transitions. Word has length 114 [2022-07-23 04:18:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:22,160 INFO L495 AbstractCegarLoop]: Abstraction has 2237 states and 3024 transitions. [2022-07-23 04:18:22,161 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-23 04:18:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3024 transitions. [2022-07-23 04:18:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-23 04:18:22,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:22,162 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-23 04:18:22,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:18:22,162 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-23 04:18:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1654081674, now seen corresponding path program 1 times [2022-07-23 04:18:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:22,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653302107] [2022-07-23 04:18:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:18:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:18:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:18:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:18:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:18:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:18:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-23 04:18:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:22,413 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-23 04:18:22,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:22,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653302107] [2022-07-23 04:18:22,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653302107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:22,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:22,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:18:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207995426] [2022-07-23 04:18:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:22,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:18:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:18:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:18:22,415 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-23 04:18:25,990 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-23 04:18:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:31,147 INFO L93 Difference]: Finished difference Result 2499 states and 3484 transitions. [2022-07-23 04:18:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:18:31,147 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-23 04:18:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:31,154 INFO L225 Difference]: With dead ends: 2499 [2022-07-23 04:18:31,155 INFO L226 Difference]: Without dead ends: 2497 [2022-07-23 04:18:31,156 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-23 04:18:31,158 INFO L413 NwaCegarLoop]: 1389 mSDtfsCounter, 3307 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 5038 mSolverCounterSat, 2330 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3374 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 7369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2330 IncrementalHoareTripleChecker+Valid, 5038 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:31,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3374 Valid, 2956 Invalid, 7369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2330 Valid, 5038 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-07-23 04:18:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2022-07-23 04:18:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2370. [2022-07-23 04:18:31,272 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-23 04:18:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3158 transitions. [2022-07-23 04:18:31,278 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3158 transitions. Word has length 139 [2022-07-23 04:18:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:31,279 INFO L495 AbstractCegarLoop]: Abstraction has 2370 states and 3158 transitions. [2022-07-23 04:18:31,279 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-23 04:18:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3158 transitions. [2022-07-23 04:18:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:18:31,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:31,280 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-23 04:18:31,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:18:31,280 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-23 04:18:31,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 861903971, now seen corresponding path program 1 times [2022-07-23 04:18:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:31,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724372397] [2022-07-23 04:18:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:18:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:31,447 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-23 04:18:31,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:31,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724372397] [2022-07-23 04:18:31,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724372397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:31,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:31,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:31,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258936248] [2022-07-23 04:18:31,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:31,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:31,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:31,449 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-23 04:18:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:34,105 INFO L93 Difference]: Finished difference Result 2370 states and 3158 transitions. [2022-07-23 04:18:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:34,105 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-23 04:18:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:34,111 INFO L225 Difference]: With dead ends: 2370 [2022-07-23 04:18:34,112 INFO L226 Difference]: Without dead ends: 2368 [2022-07-23 04:18:34,112 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-23 04:18:34,113 INFO L413 NwaCegarLoop]: 1398 mSDtfsCounter, 2591 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:34,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 2208 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-23 04:18:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-23 04:18:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2022-07-23 04:18:34,218 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-23 04:18:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3156 transitions. [2022-07-23 04:18:34,225 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3156 transitions. Word has length 120 [2022-07-23 04:18:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:34,225 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3156 transitions. [2022-07-23 04:18:34,225 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-23 04:18:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3156 transitions. [2022-07-23 04:18:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-23 04:18:34,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:34,227 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-23 04:18:34,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:18:34,227 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-23 04:18:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 805151419, now seen corresponding path program 1 times [2022-07-23 04:18:34,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:34,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475300492] [2022-07-23 04:18:34,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:18:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:34,391 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-23 04:18:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:34,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475300492] [2022-07-23 04:18:34,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475300492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:34,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:34,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858879976] [2022-07-23 04:18:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:34,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:34,394 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-23 04:18:36,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:38,463 INFO L93 Difference]: Finished difference Result 2368 states and 3156 transitions. [2022-07-23 04:18:38,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:38,464 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-23 04:18:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:38,470 INFO L225 Difference]: With dead ends: 2368 [2022-07-23 04:18:38,470 INFO L226 Difference]: Without dead ends: 2366 [2022-07-23 04:18:38,471 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-23 04:18:38,471 INFO L413 NwaCegarLoop]: 1396 mSDtfsCounter, 2585 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:38,471 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.9s Time] [2022-07-23 04:18:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2022-07-23 04:18:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2022-07-23 04:18:38,559 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-23 04:18:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3154 transitions. [2022-07-23 04:18:38,566 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3154 transitions. Word has length 126 [2022-07-23 04:18:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:38,566 INFO L495 AbstractCegarLoop]: Abstraction has 2366 states and 3154 transitions. [2022-07-23 04:18:38,566 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-23 04:18:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3154 transitions. [2022-07-23 04:18:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-23 04:18:38,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:38,568 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-23 04:18:38,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:18:38,568 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-23 04:18:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1795330939, now seen corresponding path program 1 times [2022-07-23 04:18:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:38,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407528164] [2022-07-23 04:18:38,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:18:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:18:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:38,709 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-23 04:18:38,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:38,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407528164] [2022-07-23 04:18:38,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407528164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:38,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:38,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180629114] [2022-07-23 04:18:38,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:38,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:38,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:38,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:38,711 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-23 04:18:40,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:42,106 INFO L93 Difference]: Finished difference Result 2366 states and 3154 transitions. [2022-07-23 04:18:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:42,107 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-23 04:18:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:42,114 INFO L225 Difference]: With dead ends: 2366 [2022-07-23 04:18:42,114 INFO L226 Difference]: Without dead ends: 2364 [2022-07-23 04:18:42,115 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-23 04:18:42,115 INFO L413 NwaCegarLoop]: 1394 mSDtfsCounter, 2579 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:42,115 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.2s Time] [2022-07-23 04:18:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2022-07-23 04:18:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2364. [2022-07-23 04:18:42,217 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-23 04:18:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3152 transitions. [2022-07-23 04:18:42,225 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3152 transitions. Word has length 132 [2022-07-23 04:18:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:42,226 INFO L495 AbstractCegarLoop]: Abstraction has 2364 states and 3152 transitions. [2022-07-23 04:18:42,226 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-23 04:18:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3152 transitions. [2022-07-23 04:18:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 04:18:42,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:42,229 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-23 04:18:42,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:18:42,229 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-23 04:18:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:42,229 INFO L85 PathProgramCache]: Analyzing trace with hash 710341783, now seen corresponding path program 1 times [2022-07-23 04:18:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:42,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29545002] [2022-07-23 04:18:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:42,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:18:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:18:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:18:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:42,366 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-23 04:18:42,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:42,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29545002] [2022-07-23 04:18:42,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29545002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:42,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:42,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791038811] [2022-07-23 04:18:42,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:42,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:42,368 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-23 04:18:43,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:45,847 INFO L93 Difference]: Finished difference Result 2364 states and 3152 transitions. [2022-07-23 04:18:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:45,848 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-23 04:18:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:45,854 INFO L225 Difference]: With dead ends: 2364 [2022-07-23 04:18:45,854 INFO L226 Difference]: Without dead ends: 2362 [2022-07-23 04:18:45,854 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-23 04:18:45,855 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 2573 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:45,855 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.3s Time] [2022-07-23 04:18:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-07-23 04:18:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-07-23 04:18:45,944 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-23 04:18:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3150 transitions. [2022-07-23 04:18:45,952 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3150 transitions. Word has length 138 [2022-07-23 04:18:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:45,952 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 3150 transitions. [2022-07-23 04:18:45,953 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-23 04:18:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3150 transitions. [2022-07-23 04:18:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-23 04:18:45,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:45,960 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-23 04:18:45,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:18:45,961 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-23 04:18:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1918936592, now seen corresponding path program 1 times [2022-07-23 04:18:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:45,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155393395] [2022-07-23 04:18:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:18:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:18:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:18:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:18:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,203 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-23 04:18:46,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:46,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155393395] [2022-07-23 04:18:46,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155393395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:46,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:46,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054869659] [2022-07-23 04:18:46,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:46,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:46,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:46,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:46,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:46,206 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-23 04:18:47,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:49,892 INFO L93 Difference]: Finished difference Result 2362 states and 3150 transitions. [2022-07-23 04:18:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:49,893 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-23 04:18:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:49,898 INFO L225 Difference]: With dead ends: 2362 [2022-07-23 04:18:49,898 INFO L226 Difference]: Without dead ends: 2360 [2022-07-23 04:18:49,898 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-23 04:18:49,899 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 2567 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:49,899 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.5s Time] [2022-07-23 04:18:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-07-23 04:18:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2360. [2022-07-23 04:18:49,991 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-23 04:18:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3148 transitions. [2022-07-23 04:18:49,997 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3148 transitions. Word has length 144 [2022-07-23 04:18:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:49,998 INFO L495 AbstractCegarLoop]: Abstraction has 2360 states and 3148 transitions. [2022-07-23 04:18:49,998 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-23 04:18:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3148 transitions. [2022-07-23 04:18:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 04:18:50,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:50,000 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-23 04:18:50,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:18:50,000 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-23 04:18:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash -200822391, now seen corresponding path program 1 times [2022-07-23 04:18:50,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:50,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090546696] [2022-07-23 04:18:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:18:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:18:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:18:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:18:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:18:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:50,164 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-23 04:18:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:50,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090546696] [2022-07-23 04:18:50,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090546696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:50,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:50,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135253597] [2022-07-23 04:18:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:50,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:50,167 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-23 04:18:52,534 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-23 04:18:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:54,494 INFO L93 Difference]: Finished difference Result 2360 states and 3148 transitions. [2022-07-23 04:18:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:54,494 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-23 04:18:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:54,500 INFO L225 Difference]: With dead ends: 2360 [2022-07-23 04:18:54,500 INFO L226 Difference]: Without dead ends: 2358 [2022-07-23 04:18:54,501 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-23 04:18:54,501 INFO L413 NwaCegarLoop]: 1388 mSDtfsCounter, 2561 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:54,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2646 Valid, 2198 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1651 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-23 04:18:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2022-07-23 04:18:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2358. [2022-07-23 04:18:54,617 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-23 04:18:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3146 transitions. [2022-07-23 04:18:54,624 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3146 transitions. Word has length 150 [2022-07-23 04:18:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:54,624 INFO L495 AbstractCegarLoop]: Abstraction has 2358 states and 3146 transitions. [2022-07-23 04:18:54,625 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-23 04:18:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3146 transitions. [2022-07-23 04:18:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-23 04:18:54,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:54,628 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-23 04:18:54,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:18:54,628 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-23 04:18:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1793514094, now seen corresponding path program 1 times [2022-07-23 04:18:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:54,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346392340] [2022-07-23 04:18:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:18:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:18:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:18:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:18:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:18:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:18:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:54,792 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-23 04:18:54,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:54,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346392340] [2022-07-23 04:18:54,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346392340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:54,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:54,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824791530] [2022-07-23 04:18:54,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:54,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:54,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:54,796 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-23 04:18:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:58,153 INFO L93 Difference]: Finished difference Result 2358 states and 3146 transitions. [2022-07-23 04:18:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:58,164 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-23 04:18:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:58,170 INFO L225 Difference]: With dead ends: 2358 [2022-07-23 04:18:58,171 INFO L226 Difference]: Without dead ends: 2356 [2022-07-23 04:18:58,171 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-23 04:18:58,173 INFO L413 NwaCegarLoop]: 1386 mSDtfsCounter, 2555 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:58,174 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.2s Time] [2022-07-23 04:18:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-07-23 04:18:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2356. [2022-07-23 04:18:58,276 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-23 04:18:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3144 transitions. [2022-07-23 04:18:58,283 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3144 transitions. Word has length 156 [2022-07-23 04:18:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:58,283 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 3144 transitions. [2022-07-23 04:18:58,283 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-23 04:18:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3144 transitions. [2022-07-23 04:18:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-23 04:18:58,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:58,286 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-23 04:18:58,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:18:58,286 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-23 04:18:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash 544423176, now seen corresponding path program 1 times [2022-07-23 04:18:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:58,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543721458] [2022-07-23 04:18:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:18:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:18:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:18:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:18:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:18:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:18:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:18:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:18:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:18:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:18:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:18:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:18:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:18:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:18:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:18:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:18:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:18:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:18:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:18:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:58,464 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-23 04:18:58,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:58,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543721458] [2022-07-23 04:18:58,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543721458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:58,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:58,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21149590] [2022-07-23 04:18:58,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:58,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:58,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:58,467 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-23 04:19:00,286 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-23 04:19:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:02,315 INFO L93 Difference]: Finished difference Result 2356 states and 3144 transitions. [2022-07-23 04:19:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:02,316 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-23 04:19:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:02,321 INFO L225 Difference]: With dead ends: 2356 [2022-07-23 04:19:02,321 INFO L226 Difference]: Without dead ends: 2354 [2022-07-23 04:19:02,322 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-23 04:19:02,322 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 2549 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2632 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:02,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2632 Valid, 2194 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-23 04:19:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2022-07-23 04:19:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2022-07-23 04:19:02,425 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-23 04:19:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 3142 transitions. [2022-07-23 04:19:02,432 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 3142 transitions. Word has length 162 [2022-07-23 04:19:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:02,432 INFO L495 AbstractCegarLoop]: Abstraction has 2354 states and 3142 transitions. [2022-07-23 04:19:02,432 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-23 04:19:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3142 transitions. [2022-07-23 04:19:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-23 04:19:02,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:02,435 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-23 04:19:02,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 04:19:02,436 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-23 04:19:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1029405853, now seen corresponding path program 1 times [2022-07-23 04:19:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:02,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126239891] [2022-07-23 04:19:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:19:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:19:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:19:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:19:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:19:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:19:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-23 04:19:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:19:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:19:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:19:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 04:19:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:19:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:19:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:19:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:02,700 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-23 04:19:02,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:02,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126239891] [2022-07-23 04:19:02,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126239891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:02,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:02,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:19:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168490004] [2022-07-23 04:19:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:02,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:19:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:19:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:19:02,703 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-23 04:19:05,631 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-23 04:19:07,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:19:09,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:19:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:15,707 INFO L93 Difference]: Finished difference Result 2632 states and 3755 transitions. [2022-07-23 04:19:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 04:19:15,708 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-23 04:19:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:15,715 INFO L225 Difference]: With dead ends: 2632 [2022-07-23 04:19:15,715 INFO L226 Difference]: Without dead ends: 2630 [2022-07-23 04:19:15,716 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-23 04:19:15,717 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 3132 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 6353 mSolverCounterSat, 2708 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s 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, 12.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:15,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3132 Valid, 3546 Invalid, 9063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2708 Valid, 6353 Invalid, 2 Unknown, 0 Unchecked, 12.6s Time] [2022-07-23 04:19:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2022-07-23 04:19:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2352. [2022-07-23 04:19:15,843 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-23 04:19:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3139 transitions. [2022-07-23 04:19:15,849 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3139 transitions. Word has length 189 [2022-07-23 04:19:15,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:15,849 INFO L495 AbstractCegarLoop]: Abstraction has 2352 states and 3139 transitions. [2022-07-23 04:19:15,850 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-23 04:19:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3139 transitions. [2022-07-23 04:19:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-23 04:19:15,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:15,853 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-23 04:19:15,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:19:15,853 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-23 04:19:15,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash 308324374, now seen corresponding path program 1 times [2022-07-23 04:19:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:15,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250187272] [2022-07-23 04:19:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:19:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:19:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:19:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:16,006 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-23 04:19:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:16,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250187272] [2022-07-23 04:19:16,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250187272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:16,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:16,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567083657] [2022-07-23 04:19:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:16,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:16,008 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-23 04:19:17,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:19:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:19,783 INFO L93 Difference]: Finished difference Result 2352 states and 3139 transitions. [2022-07-23 04:19:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:19,784 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-23 04:19:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:19,790 INFO L225 Difference]: With dead ends: 2352 [2022-07-23 04:19:19,790 INFO L226 Difference]: Without dead ends: 2350 [2022-07-23 04:19:19,790 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-23 04:19:19,791 INFO L413 NwaCegarLoop]: 1380 mSDtfsCounter, 2537 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2619 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:19,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2619 Valid, 2190 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-23 04:19:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2022-07-23 04:19:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2022-07-23 04:19:19,939 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-23 04:19:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3137 transitions. [2022-07-23 04:19:19,946 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3137 transitions. Word has length 168 [2022-07-23 04:19:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:19,946 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3137 transitions. [2022-07-23 04:19:19,947 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-23 04:19:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3137 transitions. [2022-07-23 04:19:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-23 04:19:19,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:19,950 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-23 04:19:19,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 04:19:19,950 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-23 04:19:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:19,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1078103048, now seen corresponding path program 1 times [2022-07-23 04:19:19,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:19,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062398411] [2022-07-23 04:19:19,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:19:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:19:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:19:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:19:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:20,146 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-23 04:19:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:20,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062398411] [2022-07-23 04:19:20,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062398411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:20,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:20,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774541501] [2022-07-23 04:19:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:20,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:20,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:20,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:20,148 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-23 04:19:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:22,554 INFO L93 Difference]: Finished difference Result 2350 states and 3137 transitions. [2022-07-23 04:19:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:22,554 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-23 04:19:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:22,560 INFO L225 Difference]: With dead ends: 2350 [2022-07-23 04:19:22,560 INFO L226 Difference]: Without dead ends: 2348 [2022-07-23 04:19:22,561 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-23 04:19:22,561 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 2531 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:22,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 2188 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-23 04:19:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2022-07-23 04:19:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2022-07-23 04:19:22,673 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-23 04:19:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3135 transitions. [2022-07-23 04:19:22,680 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3135 transitions. Word has length 174 [2022-07-23 04:19:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:22,680 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 3135 transitions. [2022-07-23 04:19:22,680 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-23 04:19:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3135 transitions. [2022-07-23 04:19:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-23 04:19:22,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:22,684 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-23 04:19:22,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:19:22,684 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-23 04:19:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1433403608, now seen corresponding path program 1 times [2022-07-23 04:19:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:22,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519166398] [2022-07-23 04:19:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:19:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:19:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:19:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:19:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:19:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:19:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:19:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:19:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:19:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:19:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:19:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:19:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:19:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:19:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:19:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:19:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:19:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:19:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:19:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:22,891 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-23 04:19:22,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:22,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519166398] [2022-07-23 04:19:22,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519166398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:22,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:22,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:19:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879736038] [2022-07-23 04:19:22,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:22,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:22,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:22,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:19:22,893 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-23 04:19:24,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:19:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:26,385 INFO L93 Difference]: Finished difference Result 2348 states and 3135 transitions. [2022-07-23 04:19:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:19:26,386 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-23 04:19:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:26,407 INFO L225 Difference]: With dead ends: 2348 [2022-07-23 04:19:26,408 INFO L226 Difference]: Without dead ends: 2192 [2022-07-23 04:19:26,411 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-23 04:19:26,411 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 2522 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:26,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 2187 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-23 04:19:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-07-23 04:19:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2192. [2022-07-23 04:19:26,520 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-23 04:19:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2955 transitions. [2022-07-23 04:19:26,527 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2955 transitions. Word has length 180 [2022-07-23 04:19:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:26,527 INFO L495 AbstractCegarLoop]: Abstraction has 2192 states and 2955 transitions. [2022-07-23 04:19:26,528 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-23 04:19:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2955 transitions. [2022-07-23 04:19:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-23 04:19:26,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:26,531 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-23 04:19:26,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 04:19:26,531 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-23 04:19:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1420850398, now seen corresponding path program 1 times [2022-07-23 04:19:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:26,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733244723] [2022-07-23 04:19:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:19:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:19:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:19:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:19:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 04:19:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:19:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:19:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:19:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:19:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:19:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-23 04:19:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 04:19:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:19:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:19:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:19:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-23 04:19:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:26,919 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-23 04:19:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:26,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733244723] [2022-07-23 04:19:26,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733244723] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:19:26,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951045826] [2022-07-23 04:19:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:19:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:19:26,921 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-23 04:19:26,922 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-23 04:19:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:27,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 2373 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 04:19:27,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:19:27,562 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-23 04:19:27,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:19:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951045826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:27,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:19:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 10 [2022-07-23 04:19:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435552189] [2022-07-23 04:19:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:27,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:19:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:19:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:19:27,564 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-23 04:19:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:27,879 INFO L93 Difference]: Finished difference Result 4383 states and 5978 transitions. [2022-07-23 04:19:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:19:27,880 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-23 04:19:27,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:27,886 INFO L225 Difference]: With dead ends: 4383 [2022-07-23 04:19:27,886 INFO L226 Difference]: Without dead ends: 2210 [2022-07-23 04:19:27,896 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-23 04:19:27,896 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 7 mSDsluCounter, 5651 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:27,897 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.2s Time] [2022-07-23 04:19:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2022-07-23 04:19:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2203. [2022-07-23 04:19:28,039 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-23 04:19:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 2969 transitions. [2022-07-23 04:19:28,045 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 2969 transitions. Word has length 205 [2022-07-23 04:19:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:28,046 INFO L495 AbstractCegarLoop]: Abstraction has 2203 states and 2969 transitions. [2022-07-23 04:19:28,046 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-23 04:19:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2969 transitions. [2022-07-23 04:19:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-23 04:19:28,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:28,050 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-23 04:19:28,075 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-23 04:19:28,263 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-23 04:19:28,264 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-23 04:19:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1268282682, now seen corresponding path program 1 times [2022-07-23 04:19:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:28,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219800468] [2022-07-23 04:19:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:19:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:19:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:19:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:19:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:19:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:19:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:19:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:19:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:19:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:19:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-23 04:19:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 04:19:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:19:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:19:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 04:19:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:19:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:28,595 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-23 04:19:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:28,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219800468] [2022-07-23 04:19:28,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219800468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:28,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:28,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-23 04:19:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567527244] [2022-07-23 04:19:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:28,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:19:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:19:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:19:28,597 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-23 04:19:32,359 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-23 04:19:34,764 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-23 04:19:36,778 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-23 04:19:38,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:19:39,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:19:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:19:47,320 INFO L93 Difference]: Finished difference Result 2830 states and 3952 transitions. [2022-07-23 04:19:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:19:47,320 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-23 04:19:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:19:47,326 INFO L225 Difference]: With dead ends: 2830 [2022-07-23 04:19:47,326 INFO L226 Difference]: Without dead ends: 2421 [2022-07-23 04:19:47,327 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-23 04:19:47,327 INFO L413 NwaCegarLoop]: 1245 mSDtfsCounter, 2004 mSDsluCounter, 3586 mSDsCounter, 0 mSdLazyCounter, 10846 mSolverCounterSat, 1802 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 4831 SdHoareTripleChecker+Invalid, 12650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1802 IncrementalHoareTripleChecker+Valid, 10846 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:19:47,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 4831 Invalid, 12650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1802 Valid, 10846 Invalid, 2 Unknown, 0 Unchecked, 18.3s Time] [2022-07-23 04:19:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2022-07-23 04:19:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2221. [2022-07-23 04:19:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 1533 states have (on average 1.2106979778212654) internal successors, (1856), 1568 states have internal predecessors, (1856), 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-23 04:19:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3008 transitions. [2022-07-23 04:19:47,448 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3008 transitions. Word has length 213 [2022-07-23 04:19:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:19:47,448 INFO L495 AbstractCegarLoop]: Abstraction has 2221 states and 3008 transitions. [2022-07-23 04:19:47,448 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-23 04:19:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3008 transitions. [2022-07-23 04:19:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-23 04:19:47,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:19:47,452 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-23 04:19:47,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 04:19:47,452 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-23 04:19:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:19:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1760355408, now seen corresponding path program 1 times [2022-07-23 04:19:47,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:19:47,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819602280] [2022-07-23 04:19:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:19:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:19:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:19:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:19:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:19:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:19:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:19:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:19:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:19:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:19:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:19:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:19:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:19:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:19:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:19:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:19:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:19:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:19:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:19:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:19:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:19:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-23 04:19:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 04:19:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:19:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:19:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:19:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-23 04:19:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:19:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:19:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:19:47,823 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-23 04:19:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:19:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819602280] [2022-07-23 04:19:47,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819602280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:19:47,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:19:47,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-23 04:19:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090342559] [2022-07-23 04:19:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:19:47,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:19:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:19:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:19:47,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:19:47,825 INFO L87 Difference]: Start difference. First operand 2221 states and 3008 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-23 04:19:51,606 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-23 04:19:53,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:07,013 INFO L93 Difference]: Finished difference Result 3011 states and 4275 transitions. [2022-07-23 04:20:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:20:07,013 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-23 04:20:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:07,020 INFO L225 Difference]: With dead ends: 3011 [2022-07-23 04:20:07,021 INFO L226 Difference]: Without dead ends: 2582 [2022-07-23 04:20:07,022 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-23 04:20:07,023 INFO L413 NwaCegarLoop]: 1250 mSDtfsCounter, 2124 mSDsluCounter, 3840 mSDsCounter, 0 mSdLazyCounter, 11838 mSolverCounterSat, 1705 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 5090 SdHoareTripleChecker+Invalid, 13544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1705 IncrementalHoareTripleChecker+Valid, 11838 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:07,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 5090 Invalid, 13544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1705 Valid, 11838 Invalid, 1 Unknown, 0 Unchecked, 18.7s Time] [2022-07-23 04:20:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2022-07-23 04:20:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2223. [2022-07-23 04:20:07,157 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-23 04:20:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3010 transitions. [2022-07-23 04:20:07,165 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3010 transitions. Word has length 221 [2022-07-23 04:20:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:07,165 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 3010 transitions. [2022-07-23 04:20:07,165 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-23 04:20:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3010 transitions. [2022-07-23 04:20:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-23 04:20:07,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:07,169 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-23 04:20:07,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 04:20:07,169 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-23 04:20:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1284645112, now seen corresponding path program 1 times [2022-07-23 04:20:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:07,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660938345] [2022-07-23 04:20:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:20:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:20:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 04:20:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:20:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:20:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:20:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:20:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:20:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:20:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:20:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:20:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:20:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:20:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:07,493 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-23 04:20:07,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:07,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660938345] [2022-07-23 04:20:07,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660938345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:20:07,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32432464] [2022-07-23 04:20:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:07,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:07,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:07,496 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-23 04:20:07,497 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-23 04:20:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:08,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-23 04:20:08,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:20:08,317 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-23 04:20:08,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:20:08,687 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-23 04:20:08,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32432464] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:20:08,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:20:08,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2022-07-23 04:20:08,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060940220] [2022-07-23 04:20:08,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:20:08,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 04:20:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 04:20:08,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2022-07-23 04:20:08,689 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-23 04:20:13,054 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-23 04:20:15,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:18,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:19,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:20,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:23,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:33,292 INFO L93 Difference]: Finished difference Result 4542 states and 6305 transitions. [2022-07-23 04:20:33,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:20:33,293 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-23 04:20:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:33,299 INFO L225 Difference]: With dead ends: 4542 [2022-07-23 04:20:33,299 INFO L226 Difference]: Without dead ends: 2336 [2022-07-23 04:20:33,307 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-23 04:20:33,307 INFO L413 NwaCegarLoop]: 1292 mSDtfsCounter, 1998 mSDsluCounter, 4597 mSDsCounter, 0 mSdLazyCounter, 14966 mSolverCounterSat, 1610 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 5889 SdHoareTripleChecker+Invalid, 16577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1610 IncrementalHoareTripleChecker+Valid, 14966 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:33,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 5889 Invalid, 16577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1610 Valid, 14966 Invalid, 1 Unknown, 0 Unchecked, 24.0s Time] [2022-07-23 04:20:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2022-07-23 04:20:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2237. [2022-07-23 04:20:33,428 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-23 04:20:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3027 transitions. [2022-07-23 04:20:33,435 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3027 transitions. Word has length 221 [2022-07-23 04:20:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:33,436 INFO L495 AbstractCegarLoop]: Abstraction has 2237 states and 3027 transitions. [2022-07-23 04:20:33,436 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-23 04:20:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3027 transitions. [2022-07-23 04:20:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-07-23 04:20:33,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:33,440 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 9, 9, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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-23 04:20:33,471 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-23 04:20:33,671 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-23 04:20:33,672 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-23 04:20:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1754433813, now seen corresponding path program 1 times [2022-07-23 04:20:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:33,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684328730] [2022-07-23 04:20:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:33,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:33,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:33,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:33,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:33,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:20:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 04:20:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:20:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:20:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:20:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-23 04:20:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:20:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:20:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 04:20:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:20:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:20:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:20:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:20:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-23 04:20:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:20:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:20:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-23 04:20:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:20:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-23 04:20:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-23 04:20:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-23 04:20:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-07-23 04:20:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-07-23 04:20:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-07-23 04:20:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:34,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684328730] [2022-07-23 04:20:34,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684328730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:20:34,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024644667] [2022-07-23 04:20:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:34,311 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-23 04:20:34,312 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-23 04:20:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:35,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 2961 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 04:20:35,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:20:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2022-07-23 04:20:35,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:20:35,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024644667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:35,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:20:35,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 28 [2022-07-23 04:20:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620878920] [2022-07-23 04:20:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:35,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:20:35,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:35,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:20:35,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2022-07-23 04:20:35,282 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-23 04:20:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:35,995 INFO L93 Difference]: Finished difference Result 4568 states and 6198 transitions. [2022-07-23 04:20:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 04:20:35,996 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 342 [2022-07-23 04:20:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:36,004 INFO L225 Difference]: With dead ends: 4568 [2022-07-23 04:20:36,004 INFO L226 Difference]: Without dead ends: 2463 [2022-07-23 04:20:36,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 438 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-23 04:20:36,037 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:20:36,037 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.3s Time] [2022-07-23 04:20:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2022-07-23 04:20:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2271. [2022-07-23 04:20:36,182 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-23 04:20:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 3071 transitions. [2022-07-23 04:20:36,190 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 3071 transitions. Word has length 342 [2022-07-23 04:20:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:36,190 INFO L495 AbstractCegarLoop]: Abstraction has 2271 states and 3071 transitions. [2022-07-23 04:20:36,191 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-23 04:20:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 3071 transitions. [2022-07-23 04:20:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-23 04:20:36,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:36,194 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 4, 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, 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] [2022-07-23 04:20:36,217 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-23 04:20:36,407 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-23 04:20:36,407 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-23 04:20:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash 787330529, now seen corresponding path program 1 times [2022-07-23 04:20:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:36,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342010960] [2022-07-23 04:20:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:20:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 04:20:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:20:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:20:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:20:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:20:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:20:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:20:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:20:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:20:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:20:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:20:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:20:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:20:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-23 04:20:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:36,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342010960] [2022-07-23 04:20:36,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342010960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:20:36,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023361050] [2022-07-23 04:20:36,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:36,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:36,901 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-23 04:20:36,902 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-23 04:20:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:37,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-23 04:20:37,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:20:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-23 04:20:37,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:20:37,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023361050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:37,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:20:37,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 15 [2022-07-23 04:20:37,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398601381] [2022-07-23 04:20:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:37,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:20:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:20:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:20:37,838 INFO L87 Difference]: Start difference. First operand 2271 states and 3071 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-23 04:20:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:38,098 INFO L93 Difference]: Finished difference Result 4536 states and 6208 transitions. [2022-07-23 04:20:38,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:20:38,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) Word has length 241 [2022-07-23 04:20:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:38,106 INFO L225 Difference]: With dead ends: 4536 [2022-07-23 04:20:38,106 INFO L226 Difference]: Without dead ends: 2284 [2022-07-23 04:20:38,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 314 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-23 04:20:38,116 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-23 04:20:38,116 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-23 04:20:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2022-07-23 04:20:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2280. [2022-07-23 04:20:38,249 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-23 04:20:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3080 transitions. [2022-07-23 04:20:38,256 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3080 transitions. Word has length 241 [2022-07-23 04:20:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:38,256 INFO L495 AbstractCegarLoop]: Abstraction has 2280 states and 3080 transitions. [2022-07-23 04:20:38,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-23 04:20:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3080 transitions. [2022-07-23 04:20:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-23 04:20:38,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:38,260 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-23 04:20:38,286 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-23 04:20:38,474 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-23 04:20:38,474 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-23 04:20:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 285054599, now seen corresponding path program 2 times [2022-07-23 04:20:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:38,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290975270] [2022-07-23 04:20:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:20:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 04:20:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:20:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:20:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:20:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:20:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:20:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:20:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:20:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:20:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:20:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:20:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:20:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-23 04:20:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:39,045 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-23 04:20:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290975270] [2022-07-23 04:20:39,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290975270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:20:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786749256] [2022-07-23 04:20:39,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 04:20:39,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:20:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:20:39,047 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-23 04:20:39,049 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-23 04:20:39,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 04:20:39,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 04:20:39,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-23 04:20:39,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:20:39,963 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-23 04:20:39,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:20:39,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786749256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:39,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:20:39,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 16 [2022-07-23 04:20:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164337425] [2022-07-23 04:20:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:39,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:20:39,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:20:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-23 04:20:39,965 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-23 04:20:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:20:40,252 INFO L93 Difference]: Finished difference Result 4150 states and 5637 transitions. [2022-07-23 04:20:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:20:40,253 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-23 04:20:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:20:40,260 INFO L225 Difference]: With dead ends: 4150 [2022-07-23 04:20:40,260 INFO L226 Difference]: Without dead ends: 1889 [2022-07-23 04:20:40,270 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-23 04:20:40,271 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-23 04:20:40,271 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-23 04:20:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-07-23 04:20:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1877. [2022-07-23 04:20:40,398 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-23 04:20:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2497 transitions. [2022-07-23 04:20:40,404 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2497 transitions. Word has length 257 [2022-07-23 04:20:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:20:40,405 INFO L495 AbstractCegarLoop]: Abstraction has 1877 states and 2497 transitions. [2022-07-23 04:20:40,405 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-23 04:20:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2497 transitions. [2022-07-23 04:20:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-23 04:20:40,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:20:40,408 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-23 04:20:40,433 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-23 04:20:40,631 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-23 04:20:40,631 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-23 04:20:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:20:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash 794527689, now seen corresponding path program 1 times [2022-07-23 04:20:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:20:40,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28983275] [2022-07-23 04:20:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:20:40,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:20:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:20:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:20:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:20:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:20:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:20:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:20:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:20:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:20:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:20:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 04:20:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:20:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:20:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:20:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:20:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:20:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:20:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:20:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:20:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:20:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:20:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:20:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:20:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:20:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:20:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-23 04:20:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:20:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:20:41,014 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-23 04:20:41,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:20:41,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28983275] [2022-07-23 04:20:41,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28983275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:20:41,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:20:41,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 04:20:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494999881] [2022-07-23 04:20:41,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:20:41,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 04:20:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:20:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 04:20:41,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-23 04:20:41,017 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-23 04:20:44,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:46,288 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-23 04:20:51,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:53,733 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-23 04:20:55,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:20:57,838 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-23 04:21:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:04,102 INFO L93 Difference]: Finished difference Result 3427 states and 4856 transitions. [2022-07-23 04:21:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 04:21:04,103 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-23 04:21:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:04,110 INFO L225 Difference]: With dead ends: 3427 [2022-07-23 04:21:04,110 INFO L226 Difference]: Without dead ends: 3425 [2022-07-23 04:21:04,111 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-23 04:21:04,111 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 6593 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 11408 mSolverCounterSat, 4929 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6666 SdHoareTripleChecker+Valid, 5723 SdHoareTripleChecker+Invalid, 16340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4929 IncrementalHoareTripleChecker+Valid, 11408 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:04,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6666 Valid, 5723 Invalid, 16340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4929 Valid, 11408 Invalid, 3 Unknown, 0 Unchecked, 22.4s Time] [2022-07-23 04:21:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2022-07-23 04:21:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3302. [2022-07-23 04:21:04,308 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-23 04:21:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4547 transitions. [2022-07-23 04:21:04,318 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4547 transitions. Word has length 257 [2022-07-23 04:21:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:04,319 INFO L495 AbstractCegarLoop]: Abstraction has 3302 states and 4547 transitions. [2022-07-23 04:21:04,319 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-23 04:21:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4547 transitions. [2022-07-23 04:21:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-23 04:21:04,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:04,322 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-23 04:21:04,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-23 04:21:04,323 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-23 04:21:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash 270197285, now seen corresponding path program 1 times [2022-07-23 04:21:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:04,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481387206] [2022-07-23 04:21:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:21:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:21:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:21:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:21:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:21:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:21:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:21:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-23 04:21:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 04:21:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:21:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 04:21:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:21:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-23 04:21:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 04:21:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:21:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:21:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-07-23 04:21:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481387206] [2022-07-23 04:21:04,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481387206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:04,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:04,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:21:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976494745] [2022-07-23 04:21:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:04,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:21:04,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:21:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:21:04,646 INFO L87 Difference]: Start difference. First operand 3302 states and 4547 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 3 states have internal predecessors, (113), 4 states have call successors, (39), 8 states have call predecessors, (39), 2 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2022-07-23 04:21:08,809 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-23 04:21:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:13,370 INFO L93 Difference]: Finished difference Result 7005 states and 10481 transitions. [2022-07-23 04:21:13,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:21:13,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 3 states have internal predecessors, (113), 4 states have call successors, (39), 8 states have call predecessors, (39), 2 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) Word has length 269 [2022-07-23 04:21:13,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:13,382 INFO L225 Difference]: With dead ends: 7005 [2022-07-23 04:21:13,383 INFO L226 Difference]: Without dead ends: 3797 [2022-07-23 04:21:13,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2022-07-23 04:21:13,392 INFO L413 NwaCegarLoop]: 1214 mSDtfsCounter, 2102 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 4681 mSolverCounterSat, 1714 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 6396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1714 IncrementalHoareTripleChecker+Valid, 4681 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:13,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 2805 Invalid, 6396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1714 Valid, 4681 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-07-23 04:21:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2022-07-23 04:21:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3320. [2022-07-23 04:21:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 2299 states have (on average 1.204436711613745) internal successors, (2769), 2343 states have internal predecessors, (2769), 800 states have call successors, (800), 196 states have call predecessors, (800), 216 states have return successors, (1002), 817 states have call predecessors, (1002), 798 states have call successors, (1002) [2022-07-23 04:21:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4571 transitions. [2022-07-23 04:21:13,648 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4571 transitions. Word has length 269 [2022-07-23 04:21:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:13,649 INFO L495 AbstractCegarLoop]: Abstraction has 3320 states and 4571 transitions. [2022-07-23 04:21:13,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 3 states have internal predecessors, (113), 4 states have call successors, (39), 8 states have call predecessors, (39), 2 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2022-07-23 04:21:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4571 transitions. [2022-07-23 04:21:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-23 04:21:13,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:13,652 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-23 04:21:13,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-23 04:21:13,652 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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-23 04:21:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1146216291, now seen corresponding path program 1 times [2022-07-23 04:21:13,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:13,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144793265] [2022-07-23 04:21:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:13,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:21:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:21:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:21:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:21:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:21:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:21:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:21:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-23 04:21:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 04:21:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:21:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 04:21:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:21:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-23 04:21:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 04:21:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:21:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:21:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-07-23 04:21:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:13,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144793265] [2022-07-23 04:21:13,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144793265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:13,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:13,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:21:13,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254327073] [2022-07-23 04:21:13,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:13,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:21:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:13,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:21:13,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:13,997 INFO L87 Difference]: Start difference. First operand 3320 states and 4571 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (39), 8 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-07-23 04:21:17,055 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-23 04:21:18,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:21:21,040 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-23 04:21:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:26,239 INFO L93 Difference]: Finished difference Result 6949 states and 10317 transitions. [2022-07-23 04:21:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:21:26,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (39), 8 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) Word has length 269 [2022-07-23 04:21:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:26,251 INFO L225 Difference]: With dead ends: 6949 [2022-07-23 04:21:26,251 INFO L226 Difference]: Without dead ends: 3713 [2022-07-23 04:21:26,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-07-23 04:21:26,261 INFO L413 NwaCegarLoop]: 1206 mSDtfsCounter, 2576 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 4808 mSolverCounterSat, 2564 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2576 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 7374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2564 IncrementalHoareTripleChecker+Valid, 4808 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:26,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2576 Valid, 2924 Invalid, 7374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2564 Valid, 4808 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2022-07-23 04:21:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2022-07-23 04:21:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3325. [2022-07-23 04:21:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 2304 states have (on average 1.2039930555555556) internal successors, (2774), 2348 states have internal predecessors, (2774), 800 states have call successors, (800), 196 states have call predecessors, (800), 216 states have return successors, (1002), 817 states have call predecessors, (1002), 798 states have call successors, (1002) [2022-07-23 04:21:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4576 transitions. [2022-07-23 04:21:26,517 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4576 transitions. Word has length 269 [2022-07-23 04:21:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:26,518 INFO L495 AbstractCegarLoop]: Abstraction has 3325 states and 4576 transitions. [2022-07-23 04:21:26,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (39), 8 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-07-23 04:21:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4576 transitions. [2022-07-23 04:21:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-23 04:21:26,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:26,521 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, 1] [2022-07-23 04:21:26,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-23 04:21:26,521 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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-23 04:21:26,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 165030668, now seen corresponding path program 1 times [2022-07-23 04:21:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:26,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225726375] [2022-07-23 04:21:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:26,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 04:21:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:21:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:21:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:21:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:21:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 04:21:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:21:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:21:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-23 04:21:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 04:21:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-23 04:21:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 04:21:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:21:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 04:21:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:21:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-23 04:21:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 04:21:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:21:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:21:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:21:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:21:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-07-23 04:21:26,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225726375] [2022-07-23 04:21:26,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225726375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:26,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:26,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:21:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109153863] [2022-07-23 04:21:26,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:26,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:21:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:21:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:26,865 INFO L87 Difference]: Start difference. First operand 3325 states and 4576 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 4 states have internal predecessors, (114), 4 states have call successors, (39), 8 states have call predecessors, (39), 2 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38)