./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--ethernet--8390--pcnet_cs.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.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 274050ce25e73de8cc1ed86f63ba21850687938f96f1d000f839b96904fb551e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 12:45:45,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 12:45:45,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 12:45:45,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 12:45:45,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 12:45:45,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 12:45:45,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 12:45:45,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 12:45:45,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 12:45:45,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 12:45:45,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 12:45:45,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 12:45:45,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 12:45:45,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 12:45:45,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 12:45:45,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 12:45:45,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 12:45:45,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 12:45:45,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 12:45:45,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 12:45:45,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 12:45:45,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 12:45:45,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 12:45:45,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 12:45:45,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 12:45:45,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 12:45:45,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 12:45:45,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 12:45:45,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 12:45:45,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 12:45:45,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 12:45:45,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 12:45:45,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 12:45:45,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 12:45:45,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 12:45:45,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 12:45:45,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 12:45:45,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 12:45:45,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 12:45:45,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 12:45:45,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 12:45:45,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 12:45:45,350 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 12:45:45,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 12:45:45,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 12:45:45,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 12:45:45,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 12:45:45,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 12:45:45,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 12:45:45,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 12:45:45,357 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 12:45:45,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 12:45:45,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 12:45:45,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 12:45:45,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 12:45:45,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 12:45:45,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 12:45:45,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 12:45:45,359 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 12:45:45,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 12:45:45,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 12:45:45,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 12:45:45,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 12:45:45,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:45:45,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 12:45:45,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 12:45:45,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 12:45:45,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 12:45:45,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 12:45:45,360 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 12:45:45,360 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 12:45:45,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 12:45:45,362 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 12:45:45,362 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 -> 274050ce25e73de8cc1ed86f63ba21850687938f96f1d000f839b96904fb551e [2021-11-17 12:45:45,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 12:45:45,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 12:45:45,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 12:45:45,563 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 12:45:45,563 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 12:45:45,564 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--ethernet--8390--pcnet_cs.ko.cil.i [2021-11-17 12:45:45,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efc6069d/598e55fcbc714b88ac761bd21fb760ff/FLAG8fc1000a4 [2021-11-17 12:45:46,240 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 12:45:46,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i [2021-11-17 12:45:46,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efc6069d/598e55fcbc714b88ac761bd21fb760ff/FLAG8fc1000a4 [2021-11-17 12:45:46,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efc6069d/598e55fcbc714b88ac761bd21fb760ff [2021-11-17 12:45:46,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 12:45:46,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 12:45:46,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 12:45:46,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 12:45:46,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 12:45:46,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:45:46" (1/1) ... [2021-11-17 12:45:46,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dec82c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:46, skipping insertion in model container [2021-11-17 12:45:46,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:45:46" (1/1) ... [2021-11-17 12:45:46,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 12:45:46,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 12:45:49,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434383,434396] [2021-11-17 12:45:49,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434528,434541] [2021-11-17 12:45:49,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434674,434687] [2021-11-17 12:45:49,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434839,434852] [2021-11-17 12:45:49,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434997,435010] [2021-11-17 12:45:49,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435155,435168] [2021-11-17 12:45:49,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435313,435326] [2021-11-17 12:45:49,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435473,435486] [2021-11-17 12:45:49,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435632,435645] [2021-11-17 12:45:49,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435771,435784] [2021-11-17 12:45:49,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435913,435926] [2021-11-17 12:45:49,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436062,436075] [2021-11-17 12:45:49,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436201,436214] [2021-11-17 12:45:49,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436356,436369] [2021-11-17 12:45:49,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436516,436529] [2021-11-17 12:45:49,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436667,436680] [2021-11-17 12:45:49,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436818,436831] [2021-11-17 12:45:49,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436970,436983] [2021-11-17 12:45:49,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437119,437132] [2021-11-17 12:45:49,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437267,437280] [2021-11-17 12:45:49,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437424,437437] [2021-11-17 12:45:49,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437573,437586] [2021-11-17 12:45:49,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437729,437742] [2021-11-17 12:45:49,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437882,437895] [2021-11-17 12:45:49,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438028,438041] [2021-11-17 12:45:49,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438171,438184] [2021-11-17 12:45:49,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438323,438336] [2021-11-17 12:45:49,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438469,438482] [2021-11-17 12:45:49,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438614,438627] [2021-11-17 12:45:49,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438768,438781] [2021-11-17 12:45:49,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438919,438932] [2021-11-17 12:45:49,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439074,439087] [2021-11-17 12:45:49,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439226,439239] [2021-11-17 12:45:49,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439381,439394] [2021-11-17 12:45:49,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439545,439558] [2021-11-17 12:45:49,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439701,439714] [2021-11-17 12:45:49,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439865,439878] [2021-11-17 12:45:49,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440007,440020] [2021-11-17 12:45:49,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440165,440178] [2021-11-17 12:45:49,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440332,440345] [2021-11-17 12:45:49,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440491,440504] [2021-11-17 12:45:49,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440650,440663] [2021-11-17 12:45:49,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440799,440812] [2021-11-17 12:45:49,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440946,440959] [2021-11-17 12:45:49,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441085,441098] [2021-11-17 12:45:49,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441248,441261] [2021-11-17 12:45:49,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441414,441427] [2021-11-17 12:45:49,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441578,441591] [2021-11-17 12:45:49,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441743,441756] [2021-11-17 12:45:49,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441908,441921] [2021-11-17 12:45:49,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442074,442087] [2021-11-17 12:45:49,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442239,442252] [2021-11-17 12:45:49,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442406,442419] [2021-11-17 12:45:49,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442566,442579] [2021-11-17 12:45:49,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442728,442741] [2021-11-17 12:45:49,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442887,442900] [2021-11-17 12:45:49,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443033,443046] [2021-11-17 12:45:49,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443176,443189] [2021-11-17 12:45:49,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443320,443333] [2021-11-17 12:45:49,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443463,443476] [2021-11-17 12:45:49,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443607,443620] [2021-11-17 12:45:49,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443748,443761] [2021-11-17 12:45:49,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443886,443899] [2021-11-17 12:45:49,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444044,444057] [2021-11-17 12:45:49,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444203,444216] [2021-11-17 12:45:49,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444359,444372] [2021-11-17 12:45:49,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444508,444521] [2021-11-17 12:45:49,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444660,444673] [2021-11-17 12:45:49,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444811,444824] [2021-11-17 12:45:49,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444960,444973] [2021-11-17 12:45:49,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445112,445125] [2021-11-17 12:45:49,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445260,445273] [2021-11-17 12:45:49,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445413,445426] [2021-11-17 12:45:49,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445564,445577] [2021-11-17 12:45:49,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445714,445727] [2021-11-17 12:45:49,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445861,445874] [2021-11-17 12:45:49,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446012,446025] [2021-11-17 12:45:49,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446163,446176] [2021-11-17 12:45:49,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446311,446324] [2021-11-17 12:45:49,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446477,446490] [2021-11-17 12:45:49,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446646,446659] [2021-11-17 12:45:49,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446813,446826] [2021-11-17 12:45:49,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446981,446994] [2021-11-17 12:45:49,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447131,447144] [2021-11-17 12:45:49,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447278,447291] [2021-11-17 12:45:49,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447439,447452] [2021-11-17 12:45:49,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447609,447622] [2021-11-17 12:45:49,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447771,447784] [2021-11-17 12:45:49,157 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:45:49,255 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 12:45:49,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434383,434396] [2021-11-17 12:45:49,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434528,434541] [2021-11-17 12:45:49,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434674,434687] [2021-11-17 12:45:49,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434839,434852] [2021-11-17 12:45:49,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[434997,435010] [2021-11-17 12:45:49,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435155,435168] [2021-11-17 12:45:49,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435313,435326] [2021-11-17 12:45:49,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435473,435486] [2021-11-17 12:45:49,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435632,435645] [2021-11-17 12:45:49,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435771,435784] [2021-11-17 12:45:49,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[435913,435926] [2021-11-17 12:45:49,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436062,436075] [2021-11-17 12:45:49,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436201,436214] [2021-11-17 12:45:49,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436356,436369] [2021-11-17 12:45:49,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436516,436529] [2021-11-17 12:45:49,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436667,436680] [2021-11-17 12:45:49,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436818,436831] [2021-11-17 12:45:49,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[436970,436983] [2021-11-17 12:45:49,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437119,437132] [2021-11-17 12:45:49,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437267,437280] [2021-11-17 12:45:49,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437424,437437] [2021-11-17 12:45:49,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437573,437586] [2021-11-17 12:45:49,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437729,437742] [2021-11-17 12:45:49,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[437882,437895] [2021-11-17 12:45:49,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438028,438041] [2021-11-17 12:45:49,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438171,438184] [2021-11-17 12:45:49,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438323,438336] [2021-11-17 12:45:49,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438469,438482] [2021-11-17 12:45:49,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438614,438627] [2021-11-17 12:45:49,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438768,438781] [2021-11-17 12:45:49,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[438919,438932] [2021-11-17 12:45:49,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439074,439087] [2021-11-17 12:45:49,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439226,439239] [2021-11-17 12:45:49,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439381,439394] [2021-11-17 12:45:49,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439545,439558] [2021-11-17 12:45:49,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439701,439714] [2021-11-17 12:45:49,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[439865,439878] [2021-11-17 12:45:49,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440007,440020] [2021-11-17 12:45:49,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440165,440178] [2021-11-17 12:45:49,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440332,440345] [2021-11-17 12:45:49,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440491,440504] [2021-11-17 12:45:49,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440650,440663] [2021-11-17 12:45:49,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440799,440812] [2021-11-17 12:45:49,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[440946,440959] [2021-11-17 12:45:49,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441085,441098] [2021-11-17 12:45:49,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441248,441261] [2021-11-17 12:45:49,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441414,441427] [2021-11-17 12:45:49,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441578,441591] [2021-11-17 12:45:49,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441743,441756] [2021-11-17 12:45:49,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[441908,441921] [2021-11-17 12:45:49,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442074,442087] [2021-11-17 12:45:49,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442239,442252] [2021-11-17 12:45:49,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442406,442419] [2021-11-17 12:45:49,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442566,442579] [2021-11-17 12:45:49,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442728,442741] [2021-11-17 12:45:49,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[442887,442900] [2021-11-17 12:45:49,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443033,443046] [2021-11-17 12:45:49,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443176,443189] [2021-11-17 12:45:49,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443320,443333] [2021-11-17 12:45:49,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443463,443476] [2021-11-17 12:45:49,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443607,443620] [2021-11-17 12:45:49,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443748,443761] [2021-11-17 12:45:49,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[443886,443899] [2021-11-17 12:45:49,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444044,444057] [2021-11-17 12:45:49,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444203,444216] [2021-11-17 12:45:49,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444359,444372] [2021-11-17 12:45:49,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444508,444521] [2021-11-17 12:45:49,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444660,444673] [2021-11-17 12:45:49,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444811,444824] [2021-11-17 12:45:49,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[444960,444973] [2021-11-17 12:45:49,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445112,445125] [2021-11-17 12:45:49,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445260,445273] [2021-11-17 12:45:49,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445413,445426] [2021-11-17 12:45:49,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445564,445577] [2021-11-17 12:45:49,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445714,445727] [2021-11-17 12:45:49,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[445861,445874] [2021-11-17 12:45:49,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446012,446025] [2021-11-17 12:45:49,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446163,446176] [2021-11-17 12:45:49,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446311,446324] [2021-11-17 12:45:49,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446477,446490] [2021-11-17 12:45:49,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446646,446659] [2021-11-17 12:45:49,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446813,446826] [2021-11-17 12:45:49,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[446981,446994] [2021-11-17 12:45:49,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447131,447144] [2021-11-17 12:45:49,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447278,447291] [2021-11-17 12:45:49,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447439,447452] [2021-11-17 12:45:49,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447609,447622] [2021-11-17 12:45:49,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i[447771,447784] [2021-11-17 12:45:49,562 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:45:49,765 INFO L208 MainTranslator]: Completed translation [2021-11-17 12:45:49,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49 WrapperNode [2021-11-17 12:45:49,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 12:45:49,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 12:45:49,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 12:45:49,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 12:45:49,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:49,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,264 INFO L137 Inliner]: procedures = 558, calls = 6257, calls flagged for inlining = 238, calls inlined = 142, statements flattened = 10796 [2021-11-17 12:45:50,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 12:45:50,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 12:45:50,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 12:45:50,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 12:45:50,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 12:45:50,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 12:45:50,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 12:45:50,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 12:45:50,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (1/1) ... [2021-11-17 12:45:50,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:45:50,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:45:50,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-17 12:45:50,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_write [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_write [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure setup_dma_config [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_dma_config [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 12:45:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:45:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ei_poll [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ei_poll [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure set_misc_reg [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure set_misc_reg [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure pcnet_release [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure pcnet_release [2021-11-17 12:45:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:45:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure NS8390_init [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure NS8390_init [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_map_mem_page [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_map_mem_page [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure outb_p [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure outb_p [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_read [2021-11-17 12:45:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_read [2021-11-17 12:45:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 12:45:50,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 12:45:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 12:45:50,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 12:45:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure pcnet_detach [2021-11-17 12:45:50,755 INFO L138 BoogieDeclarations]: Found implementation of procedure pcnet_detach [2021-11-17 12:45:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2021-11-17 12:45:50,755 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2021-11-17 12:45:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2021-11-17 12:45:50,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2021-11-17 12:45:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2021-11-17 12:45:50,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2021-11-17 12:45:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:45:50,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:45:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:45:50,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:45:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure PRIV [2021-11-17 12:45:50,764 INFO L138 BoogieDeclarations]: Found implementation of procedure PRIV [2021-11-17 12:45:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_request_window [2021-11-17 12:45:50,764 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_request_window [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_disable_device [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_disable_device [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_release_window [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_release_window [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 12:45:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_sync [2021-11-17 12:45:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_sync [2021-11-17 12:45:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:45:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:45:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:45:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:45:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure ei_tx_timeout [2021-11-17 12:45:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ei_tx_timeout [2021-11-17 12:45:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure pcnet_reset_8390 [2021-11-17 12:45:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure pcnet_reset_8390 [2021-11-17 12:45:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure ei_irq_wrapper [2021-11-17 12:45:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ei_irq_wrapper [2021-11-17 12:45:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure pcnet_try_config [2021-11-17 12:45:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure pcnet_try_config [2021-11-17 12:45:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:45:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:45:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure __readw [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __readw [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure __writew [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __writew [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure ei_set_multicast_list [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ei_set_multicast_list [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2021-11-17 12:45:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2021-11-17 12:45:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2021-11-17 12:45:50,768 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2021-11-17 12:45:51,321 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 12:45:51,323 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 12:45:51,473 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 12:46:10,757 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 12:46:10,768 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 12:46:10,769 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-17 12:46:10,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:46:10 BoogieIcfgContainer [2021-11-17 12:46:10,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 12:46:10,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 12:46:10,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 12:46:10,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 12:46:10,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:45:46" (1/3) ... [2021-11-17 12:46:10,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b86bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:46:10, skipping insertion in model container [2021-11-17 12:46:10,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:45:49" (2/3) ... [2021-11-17 12:46:10,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b86bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:46:10, skipping insertion in model container [2021-11-17 12:46:10,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:46:10" (3/3) ... [2021-11-17 12:46:10,777 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i [2021-11-17 12:46:10,780 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 12:46:10,780 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2021-11-17 12:46:10,813 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 12:46:10,817 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 12:46:10,817 INFO L340 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2021-11-17 12:46:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 1041 states, 701 states have (on average 1.2738944365192582) internal successors, (893), 739 states have internal predecessors, (893), 251 states have call successors, (251), 67 states have call predecessors, (251), 66 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2021-11-17 12:46:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-17 12:46:10,847 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:46:10,851 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:46:10,852 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:46:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:46:10,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1931371691, now seen corresponding path program 1 times [2021-11-17 12:46:10,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:46:10,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720573898] [2021-11-17 12:46:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:46:10,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:46:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:46:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:46:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:46:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:46:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:46:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:46:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:46:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:46:12,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:46:12,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720573898] [2021-11-17 12:46:12,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720573898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:46:12,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:46:12,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:46:12,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030758149] [2021-11-17 12:46:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:46:12,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:46:12,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:46:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:46:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:46:12,990 INFO L87 Difference]: Start difference. First operand has 1041 states, 701 states have (on average 1.2738944365192582) internal successors, (893), 739 states have internal predecessors, (893), 251 states have call successors, (251), 67 states have call predecessors, (251), 66 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) 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) [2021-11-17 12:46:15,259 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:17,546 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:21,796 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:24,859 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:26,882 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:46:33,795 INFO L93 Difference]: Finished difference Result 3057 states and 4194 transitions. [2021-11-17 12:46:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:46:33,797 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 [2021-11-17 12:46:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:46:33,838 INFO L225 Difference]: With dead ends: 3057 [2021-11-17 12:46:33,839 INFO L226 Difference]: Without dead ends: 2017 [2021-11-17 12:46:33,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:46:33,853 INFO L933 BasicCegarLoop]: 1508 mSDtfsCounter, 2895 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 1496 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 4011 SdHoareTripleChecker+Invalid, 3622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1496 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:46:33,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3034 Valid, 4011 Invalid, 3622 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1496 Valid, 2121 Invalid, 5 Unknown, 0 Unchecked, 20.0s Time] [2021-11-17 12:46:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2021-11-17 12:46:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1836. [2021-11-17 12:46:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1260 states have (on average 1.2444444444444445) internal successors, (1568), 1309 states have internal predecessors, (1568), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:46:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2461 transitions. [2021-11-17 12:46:34,009 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2461 transitions. Word has length 64 [2021-11-17 12:46:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:46:34,010 INFO L470 AbstractCegarLoop]: Abstraction has 1836 states and 2461 transitions. [2021-11-17 12:46:34,010 INFO L471 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) [2021-11-17 12:46:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2461 transitions. [2021-11-17 12:46:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-17 12:46:34,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:46:34,019 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:46:34,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 12:46:34,020 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:46:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:46:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash 219650086, now seen corresponding path program 1 times [2021-11-17 12:46:34,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:46:34,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864279756] [2021-11-17 12:46:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:46:34,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:46:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:46:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:46:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:46:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:46:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:46:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:46:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:46:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:46:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:46:35,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:46:35,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864279756] [2021-11-17 12:46:35,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864279756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:46:35,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:46:35,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:46:35,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471528725] [2021-11-17 12:46:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:46:35,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:46:35,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:46:35,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:46:35,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:46:35,708 INFO L87 Difference]: Start difference. First operand 1836 states and 2461 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) [2021-11-17 12:46:38,005 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:40,286 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:44,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:46:47,532 INFO L93 Difference]: Finished difference Result 1836 states and 2461 transitions. [2021-11-17 12:46:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:46:47,533 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 [2021-11-17 12:46:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:46:47,542 INFO L225 Difference]: With dead ends: 1836 [2021-11-17 12:46:47,542 INFO L226 Difference]: Without dead ends: 1834 [2021-11-17 12:46:47,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:46:47,545 INFO L933 BasicCegarLoop]: 1253 mSDtfsCounter, 1979 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:46:47,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2122 Valid, 2734 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 985 Invalid, 3 Unknown, 0 Unchecked, 11.4s Time] [2021-11-17 12:46:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2021-11-17 12:46:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2021-11-17 12:46:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1259 states have (on average 1.2438443208895948) internal successors, (1566), 1307 states have internal predecessors, (1566), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:46:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2459 transitions. [2021-11-17 12:46:47,598 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2459 transitions. Word has length 70 [2021-11-17 12:46:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:46:47,598 INFO L470 AbstractCegarLoop]: Abstraction has 1834 states and 2459 transitions. [2021-11-17 12:46:47,599 INFO L471 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) [2021-11-17 12:46:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2459 transitions. [2021-11-17 12:46:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-17 12:46:47,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:46:47,600 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:46:47,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 12:46:47,600 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:46:47,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:46:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2104811481, now seen corresponding path program 1 times [2021-11-17 12:46:47,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:46:47,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407514927] [2021-11-17 12:46:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:46:47,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:46:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:46:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:46:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:46:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:48,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:46:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:48,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:46:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:48,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:46:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:46:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:48,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:46:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:46:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:46:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:46:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:46:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:46:49,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:46:49,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407514927] [2021-11-17 12:46:49,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407514927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:46:49,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:46:49,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:46:49,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278199972] [2021-11-17 12:46:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:46:49,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:46:49,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:46:49,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:46:49,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:46:49,031 INFO L87 Difference]: Start difference. First operand 1834 states and 2459 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) [2021-11-17 12:46:51,294 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:53,583 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:46:57,615 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:00,931 INFO L93 Difference]: Finished difference Result 1834 states and 2459 transitions. [2021-11-17 12:47:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:00,932 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 [2021-11-17 12:47:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:00,939 INFO L225 Difference]: With dead ends: 1834 [2021-11-17 12:47:00,940 INFO L226 Difference]: Without dead ends: 1832 [2021-11-17 12:47:00,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:00,941 INFO L933 BasicCegarLoop]: 1251 mSDtfsCounter, 1973 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:00,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2115 Valid, 2732 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 983 Invalid, 3 Unknown, 0 Unchecked, 11.6s Time] [2021-11-17 12:47:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2021-11-17 12:47:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2021-11-17 12:47:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1258 states have (on average 1.2432432432432432) internal successors, (1564), 1305 states have internal predecessors, (1564), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:47:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2457 transitions. [2021-11-17 12:47:01,007 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2457 transitions. Word has length 76 [2021-11-17 12:47:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:01,010 INFO L470 AbstractCegarLoop]: Abstraction has 1832 states and 2457 transitions. [2021-11-17 12:47:01,010 INFO L471 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) [2021-11-17 12:47:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2457 transitions. [2021-11-17 12:47:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-17 12:47:01,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:01,012 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:47:01,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 12:47:01,013 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:47:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2086454604, now seen corresponding path program 1 times [2021-11-17 12:47:01,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:01,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834061348] [2021-11-17 12:47:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:01,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:47:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:47:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:47:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:47:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:47:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:47:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:47:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:47:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:47:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:47:02,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:02,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834061348] [2021-11-17 12:47:02,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834061348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:02,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:02,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:02,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17048932] [2021-11-17 12:47:02,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:02,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:02,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:02,395 INFO L87 Difference]: Start difference. First operand 1832 states and 2457 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) [2021-11-17 12:47:04,633 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:06,918 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:10,900 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:14,041 INFO L93 Difference]: Finished difference Result 1832 states and 2457 transitions. [2021-11-17 12:47:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:14,042 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 [2021-11-17 12:47:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:14,049 INFO L225 Difference]: With dead ends: 1832 [2021-11-17 12:47:14,049 INFO L226 Difference]: Without dead ends: 1830 [2021-11-17 12:47:14,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:14,052 INFO L933 BasicCegarLoop]: 1249 mSDtfsCounter, 1967 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:14,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2108 Valid, 2730 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 981 Invalid, 3 Unknown, 0 Unchecked, 11.3s Time] [2021-11-17 12:47:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2021-11-17 12:47:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1830. [2021-11-17 12:47:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1257 states have (on average 1.2426412092283214) internal successors, (1562), 1303 states have internal predecessors, (1562), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:47:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2455 transitions. [2021-11-17 12:47:14,124 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2455 transitions. Word has length 82 [2021-11-17 12:47:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:14,124 INFO L470 AbstractCegarLoop]: Abstraction has 1830 states and 2455 transitions. [2021-11-17 12:47:14,124 INFO L471 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) [2021-11-17 12:47:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2455 transitions. [2021-11-17 12:47:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-17 12:47:14,125 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:14,125 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:47:14,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 12:47:14,125 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:47:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash 231649261, now seen corresponding path program 1 times [2021-11-17 12:47:14,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:14,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055288564] [2021-11-17 12:47:14,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:14,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:47:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:47:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:47:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:47:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:47:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:47:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:47:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:47:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:47:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:47:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:47:15,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:15,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055288564] [2021-11-17 12:47:15,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055288564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:15,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:15,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:15,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882553645] [2021-11-17 12:47:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:15,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:15,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:15,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:15,384 INFO L87 Difference]: Start difference. First operand 1830 states and 2455 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) [2021-11-17 12:47:17,639 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:19,961 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:23,999 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:27,270 INFO L93 Difference]: Finished difference Result 1830 states and 2455 transitions. [2021-11-17 12:47:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:27,270 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 [2021-11-17 12:47:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:27,278 INFO L225 Difference]: With dead ends: 1830 [2021-11-17 12:47:27,278 INFO L226 Difference]: Without dead ends: 1828 [2021-11-17 12:47:27,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:27,280 INFO L933 BasicCegarLoop]: 1247 mSDtfsCounter, 1961 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2101 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:27,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2101 Valid, 2728 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 979 Invalid, 3 Unknown, 0 Unchecked, 11.6s Time] [2021-11-17 12:47:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2021-11-17 12:47:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1828. [2021-11-17 12:47:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1256 states have (on average 1.2420382165605095) internal successors, (1560), 1301 states have internal predecessors, (1560), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:47:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2453 transitions. [2021-11-17 12:47:27,333 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2453 transitions. Word has length 88 [2021-11-17 12:47:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:27,334 INFO L470 AbstractCegarLoop]: Abstraction has 1828 states and 2453 transitions. [2021-11-17 12:47:27,334 INFO L471 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) [2021-11-17 12:47:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2453 transitions. [2021-11-17 12:47:27,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-17 12:47:27,335 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:27,335 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:47:27,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 12:47:27,335 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:47:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1003909272, now seen corresponding path program 1 times [2021-11-17 12:47:27,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:27,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839941927] [2021-11-17 12:47:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:27,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:47:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:47:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:47:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:47:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:47:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:47:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:47:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:47:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:47:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:47:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:47:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:47:28,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:28,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839941927] [2021-11-17 12:47:28,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839941927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:28,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:28,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:28,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105372773] [2021-11-17 12:47:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:28,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:28,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:28,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:28,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:28,680 INFO L87 Difference]: Start difference. First operand 1828 states and 2453 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) [2021-11-17 12:47:30,928 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:33,239 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:37,235 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:40,488 INFO L93 Difference]: Finished difference Result 1828 states and 2453 transitions. [2021-11-17 12:47:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:40,488 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 [2021-11-17 12:47:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:40,495 INFO L225 Difference]: With dead ends: 1828 [2021-11-17 12:47:40,496 INFO L226 Difference]: Without dead ends: 1826 [2021-11-17 12:47:40,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:40,497 INFO L933 BasicCegarLoop]: 1245 mSDtfsCounter, 1955 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2094 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:40,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2094 Valid, 2726 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 977 Invalid, 3 Unknown, 0 Unchecked, 11.5s Time] [2021-11-17 12:47:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2021-11-17 12:47:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1826. [2021-11-17 12:47:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1255 states have (on average 1.2414342629482071) internal successors, (1558), 1299 states have internal predecessors, (1558), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:47:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2451 transitions. [2021-11-17 12:47:40,551 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2451 transitions. Word has length 94 [2021-11-17 12:47:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:40,552 INFO L470 AbstractCegarLoop]: Abstraction has 1826 states and 2451 transitions. [2021-11-17 12:47:40,552 INFO L471 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) [2021-11-17 12:47:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2451 transitions. [2021-11-17 12:47:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-17 12:47:40,553 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:40,553 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:47:40,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 12:47:40,553 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:47:40,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash -761449531, now seen corresponding path program 1 times [2021-11-17 12:47:40,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:40,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586017134] [2021-11-17 12:47:40,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:40,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:47:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:47:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:47:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:47:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:47:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:47:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:47:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:47:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:47:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:47:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:47:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:47:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:47:41,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:41,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586017134] [2021-11-17 12:47:41,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586017134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:41,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:41,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:41,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061252310] [2021-11-17 12:47:41,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:41,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:41,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:41,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:41,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:41,960 INFO L87 Difference]: Start difference. First operand 1826 states and 2451 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) [2021-11-17 12:47:44,240 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:46,516 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:50,495 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:47:53,836 INFO L93 Difference]: Finished difference Result 1826 states and 2451 transitions. [2021-11-17 12:47:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:47:53,837 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 [2021-11-17 12:47:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:47:53,845 INFO L225 Difference]: With dead ends: 1826 [2021-11-17 12:47:53,845 INFO L226 Difference]: Without dead ends: 1824 [2021-11-17 12:47:53,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:47:53,846 INFO L933 BasicCegarLoop]: 1243 mSDtfsCounter, 1949 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 864 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2087 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:47:53,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2087 Valid, 2724 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 976 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2021-11-17 12:47:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2021-11-17 12:47:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2021-11-17 12:47:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1254 states have (on average 1.240829346092504) internal successors, (1556), 1297 states have internal predecessors, (1556), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:47:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2449 transitions. [2021-11-17 12:47:53,902 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2449 transitions. Word has length 100 [2021-11-17 12:47:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:47:53,902 INFO L470 AbstractCegarLoop]: Abstraction has 1824 states and 2449 transitions. [2021-11-17 12:47:53,903 INFO L471 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) [2021-11-17 12:47:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2449 transitions. [2021-11-17 12:47:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-17 12:47:53,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:47:53,904 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:47:53,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 12:47:53,904 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:47:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:47:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash 40940266, now seen corresponding path program 1 times [2021-11-17 12:47:53,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:47:53,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460965992] [2021-11-17 12:47:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:47:53,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:47:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:47:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:47:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:47:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:47:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:47:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:47:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:47:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:47:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:47:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:47:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:47:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:47:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:47:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:47:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:47:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:47:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:47:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:47:55,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:47:55,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460965992] [2021-11-17 12:47:55,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460965992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:47:55,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:47:55,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:47:55,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504066890] [2021-11-17 12:47:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:47:55,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:47:55,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:47:55,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:47:55,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:47:55,400 INFO L87 Difference]: Start difference. First operand 1824 states and 2449 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) [2021-11-17 12:47:57,661 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:47:59,934 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:03,955 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:48:07,162 INFO L93 Difference]: Finished difference Result 1824 states and 2449 transitions. [2021-11-17 12:48:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:48:07,162 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 [2021-11-17 12:48:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:48:07,168 INFO L225 Difference]: With dead ends: 1824 [2021-11-17 12:48:07,168 INFO L226 Difference]: Without dead ends: 1822 [2021-11-17 12:48:07,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:48:07,169 INFO L933 BasicCegarLoop]: 1241 mSDtfsCounter, 1947 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:48:07,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2084 Valid, 2722 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 969 Invalid, 3 Unknown, 0 Unchecked, 11.4s Time] [2021-11-17 12:48:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2021-11-17 12:48:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2021-11-17 12:48:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1253 states have (on average 1.2402234636871508) internal successors, (1554), 1295 states have internal predecessors, (1554), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:48:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2447 transitions. [2021-11-17 12:48:07,225 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2447 transitions. Word has length 106 [2021-11-17 12:48:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:48:07,226 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2447 transitions. [2021-11-17 12:48:07,226 INFO L471 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) [2021-11-17 12:48:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2447 transitions. [2021-11-17 12:48:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-17 12:48:07,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:48:07,227 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:48:07,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 12:48:07,228 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:48:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:48:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash 689039789, now seen corresponding path program 1 times [2021-11-17 12:48:07,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:48:07,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37938853] [2021-11-17 12:48:07,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:48:07,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:48:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:48:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:48:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:48:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:48:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:48:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:48:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:48:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:48:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:48:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:48:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:48:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:48:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:48:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:48:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:48:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:48:08,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:48:08,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37938853] [2021-11-17 12:48:08,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37938853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:48:08,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:48:08,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:48:08,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268894059] [2021-11-17 12:48:08,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:48:08,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:48:08,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:48:08,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:48:08,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:48:08,445 INFO L87 Difference]: Start difference. First operand 1822 states and 2447 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) [2021-11-17 12:48:10,714 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:13,007 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:17,002 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:48:20,460 INFO L93 Difference]: Finished difference Result 1822 states and 2447 transitions. [2021-11-17 12:48:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:48:20,461 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 [2021-11-17 12:48:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:48:20,467 INFO L225 Difference]: With dead ends: 1822 [2021-11-17 12:48:20,467 INFO L226 Difference]: Without dead ends: 1820 [2021-11-17 12:48:20,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:48:20,468 INFO L933 BasicCegarLoop]: 1239 mSDtfsCounter, 1935 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2072 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:48:20,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2072 Valid, 2720 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 971 Invalid, 3 Unknown, 0 Unchecked, 11.7s Time] [2021-11-17 12:48:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2021-11-17 12:48:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1820. [2021-11-17 12:48:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1252 states have (on average 1.2396166134185302) internal successors, (1552), 1293 states have internal predecessors, (1552), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:48:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2445 transitions. [2021-11-17 12:48:20,665 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2445 transitions. Word has length 108 [2021-11-17 12:48:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:48:20,665 INFO L470 AbstractCegarLoop]: Abstraction has 1820 states and 2445 transitions. [2021-11-17 12:48:20,666 INFO L471 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) [2021-11-17 12:48:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2445 transitions. [2021-11-17 12:48:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-17 12:48:20,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:48:20,668 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:48:20,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 12:48:20,668 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-17 12:48:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:48:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1154959412, now seen corresponding path program 1 times [2021-11-17 12:48:20,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:48:20,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958698844] [2021-11-17 12:48:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:48:20,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:48:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:48:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:48:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:48:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:48:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:48:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:48:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:48:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:48:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:48:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:48:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:48:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:48:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:48:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:48:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:48:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:48:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:48:21,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:48:21,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958698844] [2021-11-17 12:48:21,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958698844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:48:21,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:48:21,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:48:21,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746333683] [2021-11-17 12:48:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:48:21,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:48:21,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:48:21,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:48:21,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:48:21,903 INFO L87 Difference]: Start difference. First operand 1820 states and 2445 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) [2021-11-17 12:48:24,170 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:26,504 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:30,663 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:48:33,857 INFO L93 Difference]: Finished difference Result 1820 states and 2445 transitions. [2021-11-17 12:48:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:48:33,857 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 [2021-11-17 12:48:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:48:33,863 INFO L225 Difference]: With dead ends: 1820 [2021-11-17 12:48:33,864 INFO L226 Difference]: Without dead ends: 1818 [2021-11-17 12:48:33,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:48:33,865 INFO L933 BasicCegarLoop]: 1237 mSDtfsCounter, 1931 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:48:33,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2067 Valid, 2718 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 969 Invalid, 3 Unknown, 0 Unchecked, 11.6s Time] [2021-11-17 12:48:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2021-11-17 12:48:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1818. [2021-11-17 12:48:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1251 states have (on average 1.2390087929656275) internal successors, (1550), 1291 states have internal predecessors, (1550), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:48:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2443 transitions. [2021-11-17 12:48:33,932 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2443 transitions. Word has length 114 [2021-11-17 12:48:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:48:33,933 INFO L470 AbstractCegarLoop]: Abstraction has 1818 states and 2443 transitions. [2021-11-17 12:48:33,933 INFO L471 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) [2021-11-17 12:48:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2443 transitions. [2021-11-17 12:48:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-17 12:48:33,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:48:33,934 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:48:33,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 12:48:33,935 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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 20 more)] === [2021-11-17 12:48:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:48:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1416417099, now seen corresponding path program 1 times [2021-11-17 12:48:33,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:48:33,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206442726] [2021-11-17 12:48:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:48:33,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:48:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:48:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:48:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:48:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:48:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:48:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:48:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:48:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:48:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:48:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:48:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:48:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:48:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:48:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:48:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:48:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:48:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:48:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:48:35,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:48:35,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206442726] [2021-11-17 12:48:35,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206442726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:48:35,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:48:35,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:48:35,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428992782] [2021-11-17 12:48:35,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:48:35,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:48:35,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:48:35,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:48:35,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:48:35,263 INFO L87 Difference]: Start difference. First operand 1818 states and 2443 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) [2021-11-17 12:48:37,520 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:39,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:43,774 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:48:47,048 INFO L93 Difference]: Finished difference Result 1818 states and 2443 transitions. [2021-11-17 12:48:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:48:47,049 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 [2021-11-17 12:48:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:48:47,055 INFO L225 Difference]: With dead ends: 1818 [2021-11-17 12:48:47,055 INFO L226 Difference]: Without dead ends: 1816 [2021-11-17 12:48:47,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:48:47,056 INFO L933 BasicCegarLoop]: 1235 mSDtfsCounter, 1925 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:48:47,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2060 Valid, 2716 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 967 Invalid, 3 Unknown, 0 Unchecked, 11.4s Time] [2021-11-17 12:48:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2021-11-17 12:48:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1816. [2021-11-17 12:48:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1250 states have (on average 1.2384) internal successors, (1548), 1289 states have internal predecessors, (1548), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:48:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2441 transitions. [2021-11-17 12:48:47,107 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2441 transitions. Word has length 120 [2021-11-17 12:48:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:48:47,108 INFO L470 AbstractCegarLoop]: Abstraction has 1816 states and 2441 transitions. [2021-11-17 12:48:47,108 INFO L471 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) [2021-11-17 12:48:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2441 transitions. [2021-11-17 12:48:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-17 12:48:47,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:48:47,109 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:48:47,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 12:48:47,109 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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 20 more)] === [2021-11-17 12:48:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:48:47,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1050123070, now seen corresponding path program 1 times [2021-11-17 12:48:47,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:48:47,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93259431] [2021-11-17 12:48:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:48:47,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:48:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:48:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:48:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:48:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:48:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:48:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:48:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:48:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:48:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:48:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:48:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:48:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:48:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:48:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:48:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:48:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:48:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:48:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:48:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:48:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:48:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:48:48,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:48:48,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93259431] [2021-11-17 12:48:48,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93259431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:48:48,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:48:48,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:48:48,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010500557] [2021-11-17 12:48:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:48:48,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:48:48,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:48:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:48:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:48:48,331 INFO L87 Difference]: Start difference. First operand 1816 states and 2441 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) [2021-11-17 12:48:50,566 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:52,878 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:48:56,882 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:00,219 INFO L93 Difference]: Finished difference Result 1816 states and 2441 transitions. [2021-11-17 12:49:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:49:00,220 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 [2021-11-17 12:49:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:00,226 INFO L225 Difference]: With dead ends: 1816 [2021-11-17 12:49:00,226 INFO L226 Difference]: Without dead ends: 1814 [2021-11-17 12:49:00,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:49:00,227 INFO L933 BasicCegarLoop]: 1233 mSDtfsCounter, 1919 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2053 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:00,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2053 Valid, 2714 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 965 Invalid, 3 Unknown, 0 Unchecked, 11.5s Time] [2021-11-17 12:49:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2021-11-17 12:49:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1814. [2021-11-17 12:49:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1249 states have (on average 1.2377902321857486) internal successors, (1546), 1287 states have internal predecessors, (1546), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:49:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2439 transitions. [2021-11-17 12:49:00,280 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2439 transitions. Word has length 126 [2021-11-17 12:49:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:00,280 INFO L470 AbstractCegarLoop]: Abstraction has 1814 states and 2439 transitions. [2021-11-17 12:49:00,281 INFO L471 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) [2021-11-17 12:49:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2439 transitions. [2021-11-17 12:49:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-17 12:49:00,283 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:00,283 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:49:00,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 12:49:00,284 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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 20 more)] === [2021-11-17 12:49:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1665110547, now seen corresponding path program 1 times [2021-11-17 12:49:00,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:00,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290408134] [2021-11-17 12:49:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:00,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:49:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:49:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:49:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:49:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:49:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:49:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:49:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:49:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:49:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:49:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:49:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:49:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:49:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:49:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:49:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:49:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:49:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:49:01,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:01,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290408134] [2021-11-17 12:49:01,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290408134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:01,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:01,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:49:01,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748166249] [2021-11-17 12:49:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:01,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:49:01,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:49:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:49:01,550 INFO L87 Difference]: Start difference. First operand 1814 states and 2439 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) [2021-11-17 12:49:03,822 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:06,118 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:10,392 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:13,683 INFO L93 Difference]: Finished difference Result 1814 states and 2439 transitions. [2021-11-17 12:49:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:49:13,684 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 [2021-11-17 12:49:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:13,691 INFO L225 Difference]: With dead ends: 1814 [2021-11-17 12:49:13,691 INFO L226 Difference]: Without dead ends: 1812 [2021-11-17 12:49:13,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:49:13,692 INFO L933 BasicCegarLoop]: 1231 mSDtfsCounter, 1913 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:13,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2046 Valid, 2712 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 963 Invalid, 3 Unknown, 0 Unchecked, 11.6s Time] [2021-11-17 12:49:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-11-17 12:49:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1812. [2021-11-17 12:49:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1248 states have (on average 1.2371794871794872) internal successors, (1544), 1285 states have internal predecessors, (1544), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:49:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2437 transitions. [2021-11-17 12:49:13,752 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2437 transitions. Word has length 132 [2021-11-17 12:49:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:13,753 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 2437 transitions. [2021-11-17 12:49:13,753 INFO L471 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) [2021-11-17 12:49:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2437 transitions. [2021-11-17 12:49:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-17 12:49:13,754 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:13,755 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:49:13,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 12:49:13,755 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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 20 more)] === [2021-11-17 12:49:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 984621416, now seen corresponding path program 1 times [2021-11-17 12:49:13,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:13,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096872120] [2021-11-17 12:49:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:13,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:14,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:49:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:14,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:49:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:49:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:49:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:49:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:49:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:49:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:49:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:49:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:49:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:49:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:49:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:49:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:49:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:49:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:49:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:49:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 12:49:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:49:15,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:15,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096872120] [2021-11-17 12:49:15,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096872120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:15,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:15,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:49:15,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044194303] [2021-11-17 12:49:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:15,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:49:15,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:15,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:49:15,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:49:15,102 INFO L87 Difference]: Start difference. First operand 1812 states and 2437 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) [2021-11-17 12:49:17,374 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:19,693 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:23,775 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:27,292 INFO L93 Difference]: Finished difference Result 1812 states and 2437 transitions. [2021-11-17 12:49:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:49:27,293 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 [2021-11-17 12:49:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:27,301 INFO L225 Difference]: With dead ends: 1812 [2021-11-17 12:49:27,301 INFO L226 Difference]: Without dead ends: 1810 [2021-11-17 12:49:27,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:49:27,302 INFO L933 BasicCegarLoop]: 1229 mSDtfsCounter, 1907 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:27,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2039 Valid, 2710 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 961 Invalid, 3 Unknown, 0 Unchecked, 11.8s Time] [2021-11-17 12:49:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2021-11-17 12:49:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2021-11-17 12:49:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1247 states have (on average 1.2365677626303127) internal successors, (1542), 1283 states have internal predecessors, (1542), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:49:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2435 transitions. [2021-11-17 12:49:27,367 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2435 transitions. Word has length 138 [2021-11-17 12:49:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:27,368 INFO L470 AbstractCegarLoop]: Abstraction has 1810 states and 2435 transitions. [2021-11-17 12:49:27,368 INFO L471 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) [2021-11-17 12:49:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2435 transitions. [2021-11-17 12:49:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-17 12:49:27,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:27,370 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:49:27,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 12:49:27,370 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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 20 more)] === [2021-11-17 12:49:27,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash 729833591, now seen corresponding path program 1 times [2021-11-17 12:49:27,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:27,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686920038] [2021-11-17 12:49:27,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:27,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:49:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:49:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:49:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:49:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:49:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:49:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:49:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:49:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:49:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:49:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:49:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:49:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:49:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:49:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:49:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:49:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:49:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 12:49:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 12:49:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:49:28,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:28,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686920038] [2021-11-17 12:49:28,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686920038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:28,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:28,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:49:28,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462305782] [2021-11-17 12:49:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:28,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:49:28,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:28,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:49:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:49:28,870 INFO L87 Difference]: Start difference. First operand 1810 states and 2435 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) [2021-11-17 12:49:31,130 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:33,437 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:37,419 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:40,855 INFO L93 Difference]: Finished difference Result 1810 states and 2435 transitions. [2021-11-17 12:49:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:49:40,855 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 [2021-11-17 12:49:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:40,862 INFO L225 Difference]: With dead ends: 1810 [2021-11-17 12:49:40,863 INFO L226 Difference]: Without dead ends: 1808 [2021-11-17 12:49:40,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:49:40,864 INFO L933 BasicCegarLoop]: 1227 mSDtfsCounter, 1901 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:40,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2032 Valid, 2708 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 959 Invalid, 3 Unknown, 0 Unchecked, 11.6s Time] [2021-11-17 12:49:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2021-11-17 12:49:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2021-11-17 12:49:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1246 states have (on average 1.2359550561797752) internal successors, (1540), 1281 states have internal predecessors, (1540), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:49:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2433 transitions. [2021-11-17 12:49:40,949 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2433 transitions. Word has length 144 [2021-11-17 12:49:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:40,950 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2433 transitions. [2021-11-17 12:49:40,950 INFO L471 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) [2021-11-17 12:49:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2433 transitions. [2021-11-17 12:49:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-17 12:49:40,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:40,953 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:49:40,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 12:49:40,953 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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 20 more)] === [2021-11-17 12:49:40,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:40,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2019371838, now seen corresponding path program 1 times [2021-11-17 12:49:40,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:40,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142693732] [2021-11-17 12:49:40,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:40,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:49:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:49:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:49:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:49:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:49:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:49:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:49:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:49:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:49:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:49:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:49:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:49:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:49:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:49:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:49:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:49:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:49:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 12:49:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 12:49:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 12:49:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:49:42,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:42,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142693732] [2021-11-17 12:49:42,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142693732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:42,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:42,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:49:42,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228991872] [2021-11-17 12:49:42,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:42,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:49:42,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:49:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:49:42,427 INFO L87 Difference]: Start difference. First operand 1808 states and 2433 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) [2021-11-17 12:49:44,721 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:47,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:51,012 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:49:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:49:54,507 INFO L93 Difference]: Finished difference Result 1808 states and 2433 transitions. [2021-11-17 12:49:54,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:49:54,508 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 [2021-11-17 12:49:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:49:54,514 INFO L225 Difference]: With dead ends: 1808 [2021-11-17 12:49:54,514 INFO L226 Difference]: Without dead ends: 1806 [2021-11-17 12:49:54,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:49:54,519 INFO L933 BasicCegarLoop]: 1225 mSDtfsCounter, 1895 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:49:54,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2025 Valid, 2706 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 957 Invalid, 3 Unknown, 0 Unchecked, 11.7s Time] [2021-11-17 12:49:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2021-11-17 12:49:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2021-11-17 12:49:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1245 states have (on average 1.2353413654618475) internal successors, (1538), 1279 states have internal predecessors, (1538), 444 states have call successors, (444), 111 states have call predecessors, (444), 110 states have return successors, (449), 436 states have call predecessors, (449), 442 states have call successors, (449) [2021-11-17 12:49:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2431 transitions. [2021-11-17 12:49:54,586 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2431 transitions. Word has length 150 [2021-11-17 12:49:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:49:54,587 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 2431 transitions. [2021-11-17 12:49:54,588 INFO L471 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) [2021-11-17 12:49:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2431 transitions. [2021-11-17 12:49:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 12:49:54,590 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:49:54,590 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2021-11-17 12:49:54,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 12:49:54,590 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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 20 more)] === [2021-11-17 12:49:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:49:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -358834164, now seen corresponding path program 1 times [2021-11-17 12:49:54,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:49:54,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469494791] [2021-11-17 12:49:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:49:54,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:49:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:49:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:49:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:49:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:49:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:49:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:49:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:49:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:49:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:49:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 12:49:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:49:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:49:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 12:49:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 12:49:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 12:49:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:49:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:49:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 12:49:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:49:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:49:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-11-17 12:49:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:49:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-11-17 12:49:56,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:49:56,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469494791] [2021-11-17 12:49:56,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469494791] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:49:56,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:49:56,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:49:56,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122991618] [2021-11-17 12:49:56,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:49:56,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:49:56,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:49:56,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:49:56,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:49:56,815 INFO L87 Difference]: Start difference. First operand 1806 states and 2431 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:49:59,093 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:01,359 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:07,653 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:09,661 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:50:16,109 INFO L93 Difference]: Finished difference Result 3854 states and 5231 transitions. [2021-11-17 12:50:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:50:16,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 181 [2021-11-17 12:50:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:50:16,116 INFO L225 Difference]: With dead ends: 3854 [2021-11-17 12:50:16,116 INFO L226 Difference]: Without dead ends: 2067 [2021-11-17 12:50:16,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:50:16,121 INFO L933 BasicCegarLoop]: 1404 mSDtfsCounter, 420 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 394 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 6893 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:50:16,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 6893 Invalid, 2523 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [394 Valid, 2125 Invalid, 4 Unknown, 0 Unchecked, 18.8s Time] [2021-11-17 12:50:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2021-11-17 12:50:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1821. [2021-11-17 12:50:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1257 states have (on average 1.233890214797136) internal successors, (1551), 1291 states have internal predecessors, (1551), 444 states have call successors, (444), 111 states have call predecessors, (444), 113 states have return successors, (459), 439 states have call predecessors, (459), 442 states have call successors, (459) [2021-11-17 12:50:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2454 transitions. [2021-11-17 12:50:16,197 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2454 transitions. Word has length 181 [2021-11-17 12:50:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:50:16,198 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2454 transitions. [2021-11-17 12:50:16,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:50:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2454 transitions. [2021-11-17 12:50:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-17 12:50:16,199 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:50:16,199 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:50:16,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 12:50:16,200 INFO L402 AbstractCegarLoop]: === Iteration 18 === 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 20 more)] === [2021-11-17 12:50:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:50:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2143989943, now seen corresponding path program 1 times [2021-11-17 12:50:16,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:50:16,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764381520] [2021-11-17 12:50:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:50:16,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:50:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:50:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:50:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:50:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:50:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:50:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:50:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:50:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:50:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:50:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:50:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:50:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:50:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:50:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:50:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:50:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:50:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:50:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:50:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:50:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 12:50:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 12:50:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 12:50:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 12:50:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:50:17,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:50:17,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764381520] [2021-11-17 12:50:17,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764381520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:50:17,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:50:17,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:50:17,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486971006] [2021-11-17 12:50:17,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:50:17,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:50:17,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:50:17,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:50:17,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:50:17,570 INFO L87 Difference]: Start difference. First operand 1821 states and 2454 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) [2021-11-17 12:50:19,825 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:22,137 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:26,431 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:50:29,743 INFO L93 Difference]: Finished difference Result 1821 states and 2454 transitions. [2021-11-17 12:50:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:50:29,744 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 [2021-11-17 12:50:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:50:29,751 INFO L225 Difference]: With dead ends: 1821 [2021-11-17 12:50:29,751 INFO L226 Difference]: Without dead ends: 1819 [2021-11-17 12:50:29,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:50:29,752 INFO L933 BasicCegarLoop]: 1223 mSDtfsCounter, 1889 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2018 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:50:29,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2018 Valid, 2704 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 955 Invalid, 3 Unknown, 0 Unchecked, 11.7s Time] [2021-11-17 12:50:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2021-11-17 12:50:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1819. [2021-11-17 12:50:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1256 states have (on average 1.23328025477707) internal successors, (1549), 1289 states have internal predecessors, (1549), 444 states have call successors, (444), 111 states have call predecessors, (444), 113 states have return successors, (459), 439 states have call predecessors, (459), 442 states have call successors, (459) [2021-11-17 12:50:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2452 transitions. [2021-11-17 12:50:29,829 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2452 transitions. Word has length 156 [2021-11-17 12:50:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:50:29,829 INFO L470 AbstractCegarLoop]: Abstraction has 1819 states and 2452 transitions. [2021-11-17 12:50:29,830 INFO L471 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) [2021-11-17 12:50:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2452 transitions. [2021-11-17 12:50:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-17 12:50:29,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:50:29,831 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:50:29,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 12:50:29,832 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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 20 more)] === [2021-11-17 12:50:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:50:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash 855852546, now seen corresponding path program 1 times [2021-11-17 12:50:29,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:50:29,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801270020] [2021-11-17 12:50:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:50:29,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:50:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:50:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:50:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:50:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:50:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:50:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:50:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:50:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:50:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:50:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:50:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:50:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:50:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:50:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:50:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:50:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:50:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:50:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:50:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:50:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 12:50:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 12:50:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 12:50:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 12:50:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 12:50:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:50:31,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:50:31,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801270020] [2021-11-17 12:50:31,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801270020] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:50:31,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:50:31,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:50:31,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351536636] [2021-11-17 12:50:31,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:50:31,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:50:31,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:50:31,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:50:31,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:50:31,203 INFO L87 Difference]: Start difference. First operand 1819 states and 2452 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) [2021-11-17 12:50:33,468 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:35,769 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:40,078 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:50:43,373 INFO L93 Difference]: Finished difference Result 1819 states and 2452 transitions. [2021-11-17 12:50:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:50:43,373 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 [2021-11-17 12:50:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:50:43,379 INFO L225 Difference]: With dead ends: 1819 [2021-11-17 12:50:43,379 INFO L226 Difference]: Without dead ends: 1817 [2021-11-17 12:50:43,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:50:43,380 INFO L933 BasicCegarLoop]: 1221 mSDtfsCounter, 1883 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:50:43,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2011 Valid, 2702 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 953 Invalid, 3 Unknown, 0 Unchecked, 11.8s Time] [2021-11-17 12:50:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2021-11-17 12:50:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1817. [2021-11-17 12:50:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1255 states have (on average 1.2326693227091634) internal successors, (1547), 1287 states have internal predecessors, (1547), 444 states have call successors, (444), 111 states have call predecessors, (444), 113 states have return successors, (459), 439 states have call predecessors, (459), 442 states have call successors, (459) [2021-11-17 12:50:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2450 transitions. [2021-11-17 12:50:43,454 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2450 transitions. Word has length 162 [2021-11-17 12:50:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:50:43,454 INFO L470 AbstractCegarLoop]: Abstraction has 1817 states and 2450 transitions. [2021-11-17 12:50:43,454 INFO L471 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) [2021-11-17 12:50:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2450 transitions. [2021-11-17 12:50:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-17 12:50:43,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:50:43,456 INFO L514 BasicCegarLoop]: 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] [2021-11-17 12:50:43,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 12:50:43,457 INFO L402 AbstractCegarLoop]: === Iteration 20 === 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 20 more)] === [2021-11-17 12:50:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:50:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1556709831, now seen corresponding path program 1 times [2021-11-17 12:50:43,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:50:43,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464183531] [2021-11-17 12:50:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:50:43,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:50:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:50:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:50:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:50:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 12:50:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 12:50:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 12:50:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:50:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 12:50:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 12:50:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 12:50:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 12:50:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:50:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:50:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 12:50:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 12:50:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:50:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:50:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:44,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 12:50:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 12:50:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 12:50:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 12:50:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-17 12:50:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-17 12:50:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-17 12:50:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-17 12:50:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:50:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:50:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 12:50:45,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:50:45,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464183531] [2021-11-17 12:50:45,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464183531] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:50:45,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:50:45,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:50:45,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765718336] [2021-11-17 12:50:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:50:45,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:50:45,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:50:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:50:45,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:50:45,043 INFO L87 Difference]: Start difference. First operand 1817 states and 2450 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) [2021-11-17 12:50:47,391 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:49,691 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:53,806 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:50:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:50:57,196 INFO L93 Difference]: Finished difference Result 1817 states and 2450 transitions. [2021-11-17 12:50:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:50:57,197 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 [2021-11-17 12:50:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:50:57,204 INFO L225 Difference]: With dead ends: 1817 [2021-11-17 12:50:57,204 INFO L226 Difference]: Without dead ends: 1815 [2021-11-17 12:50:57,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:50:57,206 INFO L933 BasicCegarLoop]: 1219 mSDtfsCounter, 1877 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 864 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:50:57,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2004 Valid, 2700 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 951 Invalid, 3 Unknown, 0 Unchecked, 11.7s Time] [2021-11-17 12:50:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2021-11-17 12:50:57,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1815. [2021-11-17 12:50:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1254 states have (on average 1.2320574162679425) internal successors, (1545), 1285 states have internal predecessors, (1545), 444 states have call successors, (444), 111 states have call predecessors, (444), 113 states have return successors, (459), 439 states have call predecessors, (459), 442 states have call successors, (459) [2021-11-17 12:50:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2448 transitions. [2021-11-17 12:50:57,288 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2448 transitions. Word has length 168 [2021-11-17 12:50:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:50:57,288 INFO L470 AbstractCegarLoop]: Abstraction has 1815 states and 2448 transitions. [2021-11-17 12:50:57,289 INFO L471 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) [2021-11-17 12:50:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2448 transitions. [2021-11-17 12:50:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-17 12:50:57,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:50:57,291 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:50:57,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 12:50:57,291 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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 20 more)] === [2021-11-17 12:50:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:50:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1149880206, now seen corresponding path program 1 times [2021-11-17 12:50:57,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:50:57,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921978518] [2021-11-17 12:50:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:50:57,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:51:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:51:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:51:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:51:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:51:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:51:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:51:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 12:51:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:51:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:51:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 12:51:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:51:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 12:51:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 12:51:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:51:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:51:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-17 12:51:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 12:51:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 12:51:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-17 12:51:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-17 12:51:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 12:51:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 12:51:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:51:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 12:51:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:51:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-11-17 12:51:01,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:51:01,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921978518] [2021-11-17 12:51:01,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921978518] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:51:01,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366732834] [2021-11-17 12:51:01,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:51:01,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:51:01,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:51:01,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:51:01,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process Killed by 15