./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 19:55:19,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:55:19,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:55:19,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:55:19,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:55:19,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:55:19,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:55:19,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:55:19,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:55:19,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:55:19,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:55:19,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:55:19,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:55:19,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:55:19,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:55:19,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:55:19,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:55:19,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:55:19,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:55:19,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:55:19,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:55:19,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:55:19,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:55:19,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:55:19,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:55:19,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:55:19,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:55:19,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:55:19,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:55:19,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:55:19,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:55:19,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:55:19,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:55:19,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:55:19,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:55:19,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:55:19,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:55:19,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:55:19,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:55:19,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:55:19,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:55:19,613 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 19:55:19,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:55:19,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:55:19,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:55:19,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:55:19,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:55:19,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:55:19,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:55:19,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:55:19,660 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:55:19,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:55:19,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:55:19,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:55:19,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 19:55:19,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:55:19,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 19:55:19,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 19:55:19,663 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:55:19,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 19:55:19,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:55:19,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:55:19,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:55:19,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:55:19,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:55:19,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:55:19,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 19:55:19,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:55:19,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:55:19,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 19:55:19,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 19:55:19,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 19:55:19,667 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2022-11-02 19:55:20,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:55:20,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:55:20,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:55:20,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:55:20,092 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:55:20,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2022-11-02 19:55:20,162 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/data/65da396d7/fa41fab0ddd8470a9588b15fcc004ef3/FLAG5f8c03f14 [2022-11-02 19:55:21,044 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:55:21,045 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2022-11-02 19:55:21,109 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/data/65da396d7/fa41fab0ddd8470a9588b15fcc004ef3/FLAG5f8c03f14 [2022-11-02 19:55:21,507 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/data/65da396d7/fa41fab0ddd8470a9588b15fcc004ef3 [2022-11-02 19:55:21,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:55:21,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:55:21,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:55:21,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:55:21,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:55:21,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:55:21" (1/1) ... [2022-11-02 19:55:21,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb3a799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:21, skipping insertion in model container [2022-11-02 19:55:21,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:55:21" (1/1) ... [2022-11-02 19:55:21,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:55:21,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:55:24,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2022-11-02 19:55:24,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2022-11-02 19:55:24,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2022-11-02 19:55:24,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2022-11-02 19:55:24,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2022-11-02 19:55:24,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2022-11-02 19:55:24,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2022-11-02 19:55:24,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2022-11-02 19:55:24,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2022-11-02 19:55:24,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2022-11-02 19:55:24,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2022-11-02 19:55:24,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2022-11-02 19:55:24,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2022-11-02 19:55:24,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2022-11-02 19:55:24,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2022-11-02 19:55:24,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2022-11-02 19:55:24,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2022-11-02 19:55:24,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2022-11-02 19:55:24,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2022-11-02 19:55:24,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2022-11-02 19:55:24,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2022-11-02 19:55:24,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2022-11-02 19:55:24,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2022-11-02 19:55:24,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2022-11-02 19:55:24,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2022-11-02 19:55:24,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2022-11-02 19:55:24,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2022-11-02 19:55:24,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2022-11-02 19:55:24,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2022-11-02 19:55:24,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2022-11-02 19:55:24,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2022-11-02 19:55:24,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2022-11-02 19:55:24,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2022-11-02 19:55:24,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2022-11-02 19:55:24,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2022-11-02 19:55:24,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2022-11-02 19:55:24,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2022-11-02 19:55:24,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2022-11-02 19:55:24,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2022-11-02 19:55:24,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2022-11-02 19:55:24,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2022-11-02 19:55:24,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2022-11-02 19:55:24,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2022-11-02 19:55:24,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2022-11-02 19:55:24,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2022-11-02 19:55:24,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2022-11-02 19:55:24,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2022-11-02 19:55:24,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2022-11-02 19:55:24,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2022-11-02 19:55:24,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2022-11-02 19:55:24,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2022-11-02 19:55:24,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2022-11-02 19:55:24,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2022-11-02 19:55:24,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2022-11-02 19:55:24,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2022-11-02 19:55:24,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2022-11-02 19:55:24,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2022-11-02 19:55:24,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2022-11-02 19:55:24,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2022-11-02 19:55:24,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2022-11-02 19:55:24,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2022-11-02 19:55:24,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2022-11-02 19:55:24,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2022-11-02 19:55:24,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2022-11-02 19:55:24,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2022-11-02 19:55:24,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2022-11-02 19:55:24,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2022-11-02 19:55:24,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2022-11-02 19:55:24,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2022-11-02 19:55:24,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2022-11-02 19:55:24,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2022-11-02 19:55:24,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2022-11-02 19:55:24,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2022-11-02 19:55:24,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2022-11-02 19:55:24,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2022-11-02 19:55:24,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2022-11-02 19:55:24,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2022-11-02 19:55:24,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2022-11-02 19:55:24,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2022-11-02 19:55:24,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2022-11-02 19:55:24,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2022-11-02 19:55:24,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2022-11-02 19:55:24,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2022-11-02 19:55:24,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2022-11-02 19:55:24,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2022-11-02 19:55:24,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2022-11-02 19:55:24,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2022-11-02 19:55:24,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2022-11-02 19:55:24,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:55:24,561 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:55:24,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2022-11-02 19:55:24,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2022-11-02 19:55:24,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2022-11-02 19:55:24,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2022-11-02 19:55:24,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2022-11-02 19:55:24,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2022-11-02 19:55:24,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2022-11-02 19:55:24,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2022-11-02 19:55:24,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2022-11-02 19:55:24,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2022-11-02 19:55:24,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2022-11-02 19:55:24,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2022-11-02 19:55:24,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2022-11-02 19:55:24,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2022-11-02 19:55:24,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2022-11-02 19:55:24,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2022-11-02 19:55:24,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2022-11-02 19:55:24,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2022-11-02 19:55:24,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2022-11-02 19:55:24,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2022-11-02 19:55:24,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2022-11-02 19:55:24,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2022-11-02 19:55:24,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2022-11-02 19:55:24,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2022-11-02 19:55:24,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2022-11-02 19:55:24,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2022-11-02 19:55:24,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2022-11-02 19:55:24,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2022-11-02 19:55:24,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2022-11-02 19:55:24,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2022-11-02 19:55:24,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2022-11-02 19:55:24,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2022-11-02 19:55:24,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2022-11-02 19:55:24,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2022-11-02 19:55:24,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2022-11-02 19:55:24,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2022-11-02 19:55:24,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2022-11-02 19:55:24,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2022-11-02 19:55:24,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2022-11-02 19:55:24,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2022-11-02 19:55:24,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2022-11-02 19:55:24,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2022-11-02 19:55:24,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2022-11-02 19:55:24,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2022-11-02 19:55:24,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2022-11-02 19:55:24,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2022-11-02 19:55:24,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2022-11-02 19:55:24,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2022-11-02 19:55:24,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2022-11-02 19:55:24,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2022-11-02 19:55:24,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2022-11-02 19:55:24,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2022-11-02 19:55:24,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2022-11-02 19:55:24,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2022-11-02 19:55:24,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2022-11-02 19:55:24,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2022-11-02 19:55:24,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2022-11-02 19:55:24,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2022-11-02 19:55:24,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2022-11-02 19:55:24,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2022-11-02 19:55:24,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2022-11-02 19:55:24,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2022-11-02 19:55:24,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2022-11-02 19:55:24,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2022-11-02 19:55:24,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2022-11-02 19:55:24,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2022-11-02 19:55:24,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2022-11-02 19:55:24,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2022-11-02 19:55:24,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2022-11-02 19:55:24,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2022-11-02 19:55:24,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2022-11-02 19:55:24,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2022-11-02 19:55:24,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2022-11-02 19:55:24,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2022-11-02 19:55:24,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2022-11-02 19:55:24,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2022-11-02 19:55:24,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2022-11-02 19:55:24,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2022-11-02 19:55:24,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2022-11-02 19:55:24,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2022-11-02 19:55:24,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2022-11-02 19:55:24,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2022-11-02 19:55:24,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2022-11-02 19:55:24,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2022-11-02 19:55:24,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2022-11-02 19:55:24,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2022-11-02 19:55:24,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2022-11-02 19:55:24,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2022-11-02 19:55:24,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:55:25,070 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:55:25,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25 WrapperNode [2022-11-02 19:55:25,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:55:25,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:55:25,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:55:25,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:55:25,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,289 INFO L138 Inliner]: procedures = 526, calls = 1327, calls flagged for inlining = 223, calls inlined = 134, statements flattened = 2372 [2022-11-02 19:55:25,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:55:25,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:55:25,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:55:25,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:55:25,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,440 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:55:25,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:55:25,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:55:25,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:55:25,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (1/1) ... [2022-11-02 19:55:25,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:55:25,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:55:25,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:55:25,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:55:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-11-02 19:55:25,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-11-02 19:55:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 19:55:25,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 19:55:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-02 19:55:25,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-02 19:55:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-11-02 19:55:25,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-11-02 19:55:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 19:55:25,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 19:55:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-11-02 19:55:25,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-11-02 19:55:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-11-02 19:55:25,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-11-02 19:55:25,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2022-11-02 19:55:25,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2022-11-02 19:55:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-02 19:55:25,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-02 19:55:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-02 19:55:25,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-02 19:55:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-11-02 19:55:25,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-11-02 19:55:25,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 19:55:25,573 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 19:55:25,573 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 19:55:25,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-11-02 19:55:25,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-11-02 19:55:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-11-02 19:55:25,574 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-11-02 19:55:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 19:55:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-11-02 19:55:25,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-11-02 19:55:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-02 19:55:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-02 19:55:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2022-11-02 19:55:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2022-11-02 19:55:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-02 19:55:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-02 19:55:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 19:55:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-11-02 19:55:25,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-11-02 19:55:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-11-02 19:55:25,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-11-02 19:55:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-11-02 19:55:25,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-11-02 19:55:25,577 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 19:55:25,577 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 19:55:25,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-02 19:55:25,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-02 19:55:25,577 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-11-02 19:55:25,577 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-11-02 19:55:25,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-11-02 19:55:25,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-11-02 19:55:25,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2022-11-02 19:55:25,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2022-11-02 19:55:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2022-11-02 19:55:25,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2022-11-02 19:55:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-02 19:55:25,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-02 19:55:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 19:55:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:55:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 19:55:25,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 19:55:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 19:55:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-11-02 19:55:25,580 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-11-02 19:55:25,581 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 19:55:25,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 19:55:25,581 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-11-02 19:55:25,581 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-11-02 19:55:25,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-11-02 19:55:25,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-11-02 19:55:25,586 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-11-02 19:55:25,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-11-02 19:55:25,586 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-11-02 19:55:25,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-11-02 19:55:25,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2022-11-02 19:55:25,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2022-11-02 19:55:25,587 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-11-02 19:55:25,587 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-11-02 19:55:25,587 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-11-02 19:55:25,588 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-11-02 19:55:25,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:55:25,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:55:25,590 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-11-02 19:55:25,591 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-11-02 19:55:25,591 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2022-11-02 19:55:25,591 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2022-11-02 19:55:25,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 19:55:25,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 19:55:25,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 19:55:25,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 19:55:25,592 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-11-02 19:55:25,592 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-11-02 19:55:25,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-11-02 19:55:25,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-11-02 19:55:25,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-11-02 19:55:25,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-11-02 19:55:25,593 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2022-11-02 19:55:25,593 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2022-11-02 19:55:25,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-11-02 19:55:25,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-11-02 19:55:25,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2022-11-02 19:55:25,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2022-11-02 19:55:25,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 19:55:25,594 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-02 19:55:25,594 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-02 19:55:25,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-02 19:55:25,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-02 19:55:25,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 19:55:25,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 19:55:25,595 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-02 19:55:25,595 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-02 19:55:25,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-02 19:55:25,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-02 19:55:25,595 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-02 19:55:25,595 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-02 19:55:25,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-02 19:55:25,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-02 19:55:25,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2022-11-02 19:55:25,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2022-11-02 19:55:25,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-11-02 19:55:25,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-11-02 19:55:25,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-11-02 19:55:25,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-11-02 19:55:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-02 19:55:25,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-02 19:55:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-11-02 19:55:25,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-11-02 19:55:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-11-02 19:55:25,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-11-02 19:55:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 19:55:25,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 19:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-02 19:55:25,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-02 19:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-11-02 19:55:25,599 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-11-02 19:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2022-11-02 19:55:25,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2022-11-02 19:55:25,600 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 19:55:25,600 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 19:55:25,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-11-02 19:55:25,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-11-02 19:55:25,601 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2022-11-02 19:55:25,601 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2022-11-02 19:55:25,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 19:55:25,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-02 19:55:25,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-02 19:55:25,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 19:55:25,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 19:55:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-02 19:55:25,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-02 19:55:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-11-02 19:55:25,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-11-02 19:55:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-02 19:55:25,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-02 19:55:25,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-02 19:55:25,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-02 19:55:25,603 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2022-11-02 19:55:25,603 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2022-11-02 19:55:25,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:55:25,603 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2022-11-02 19:55:25,603 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2022-11-02 19:55:25,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2022-11-02 19:55:25,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2022-11-02 19:55:26,275 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:55:26,278 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:55:26,588 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 19:55:30,703 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:55:30,719 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:55:30,719 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 19:55:30,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:55:30 BoogieIcfgContainer [2022-11-02 19:55:30,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:55:30,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:55:30,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:55:30,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:55:30,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:55:21" (1/3) ... [2022-11-02 19:55:30,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f6b313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:55:30, skipping insertion in model container [2022-11-02 19:55:30,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:55:25" (2/3) ... [2022-11-02 19:55:30,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f6b313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:55:30, skipping insertion in model container [2022-11-02 19:55:30,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:55:30" (3/3) ... [2022-11-02 19:55:30,739 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2022-11-02 19:55:30,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:55:30,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-02 19:55:30,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:55:30,869 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5552fcb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:55:30,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-02 19:55:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 988 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 687 states have internal predecessors, (823), 240 states have call successors, (240), 76 states have call predecessors, (240), 75 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) [2022-11-02 19:55:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 19:55:30,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:30,895 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:30,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash 248613159, now seen corresponding path program 1 times [2022-11-02 19:55:30,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:30,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491320251] [2022-11-02 19:55:30,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:30,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:31,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:31,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491320251] [2022-11-02 19:55:32,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491320251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:32,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:32,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283384863] [2022-11-02 19:55:32,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:32,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:32,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:32,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:32,207 INFO L87 Difference]: Start difference. First operand has 988 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 687 states have internal predecessors, (823), 240 states have call successors, (240), 76 states have call predecessors, (240), 75 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 19:55:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:35,069 INFO L93 Difference]: Finished difference Result 1927 states and 2626 transitions. [2022-11-02 19:55:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:35,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-11-02 19:55:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:35,093 INFO L225 Difference]: With dead ends: 1927 [2022-11-02 19:55:35,094 INFO L226 Difference]: Without dead ends: 970 [2022-11-02 19:55:35,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:35,105 INFO L413 NwaCegarLoop]: 1213 mSDtfsCounter, 1656 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:35,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1834 Valid, 2712 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 19:55:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-02 19:55:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-02 19:55:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 632 states have (on average 1.2294303797468353) internal successors, (777), 672 states have internal predecessors, (777), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1245 transitions. [2022-11-02 19:55:35,283 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1245 transitions. Word has length 71 [2022-11-02 19:55:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:35,284 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1245 transitions. [2022-11-02 19:55:35,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 19:55:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1245 transitions. [2022-11-02 19:55:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 19:55:35,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:35,341 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:35,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:55:35,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash 544752548, now seen corresponding path program 1 times [2022-11-02 19:55:35,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:35,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826979445] [2022-11-02 19:55:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:35,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:35,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826979445] [2022-11-02 19:55:35,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826979445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:35,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:35,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541737981] [2022-11-02 19:55:35,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:35,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:35,889 INFO L87 Difference]: Start difference. First operand 970 states and 1245 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 19:55:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:38,435 INFO L93 Difference]: Finished difference Result 970 states and 1245 transitions. [2022-11-02 19:55:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:38,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-11-02 19:55:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:38,442 INFO L225 Difference]: With dead ends: 970 [2022-11-02 19:55:38,443 INFO L226 Difference]: Without dead ends: 968 [2022-11-02 19:55:38,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:38,445 INFO L413 NwaCegarLoop]: 1193 mSDtfsCounter, 1622 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:38,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 2672 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 19:55:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-11-02 19:55:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2022-11-02 19:55:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 631 states have (on average 1.2282091917591125) internal successors, (775), 670 states have internal predecessors, (775), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1243 transitions. [2022-11-02 19:55:38,547 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1243 transitions. Word has length 77 [2022-11-02 19:55:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:38,548 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1243 transitions. [2022-11-02 19:55:38,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 19:55:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1243 transitions. [2022-11-02 19:55:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 19:55:38,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:38,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:38,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 19:55:38,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:38,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1429765362, now seen corresponding path program 1 times [2022-11-02 19:55:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:38,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791975021] [2022-11-02 19:55:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:55:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:39,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791975021] [2022-11-02 19:55:39,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791975021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:39,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:39,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658470876] [2022-11-02 19:55:39,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:39,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:39,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:39,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:39,037 INFO L87 Difference]: Start difference. First operand 968 states and 1243 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 19:55:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:41,549 INFO L93 Difference]: Finished difference Result 968 states and 1243 transitions. [2022-11-02 19:55:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-11-02 19:55:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:41,556 INFO L225 Difference]: With dead ends: 968 [2022-11-02 19:55:41,557 INFO L226 Difference]: Without dead ends: 966 [2022-11-02 19:55:41,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:41,558 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 1616 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:41,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 2670 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 19:55:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-11-02 19:55:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2022-11-02 19:55:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 630 states have (on average 1.226984126984127) internal successors, (773), 668 states have internal predecessors, (773), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1241 transitions. [2022-11-02 19:55:41,625 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1241 transitions. Word has length 83 [2022-11-02 19:55:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:41,626 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 1241 transitions. [2022-11-02 19:55:41,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 19:55:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1241 transitions. [2022-11-02 19:55:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 19:55:41,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:41,628 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:41,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 19:55:41,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:41,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash -454572405, now seen corresponding path program 1 times [2022-11-02 19:55:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:41,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147575512] [2022-11-02 19:55:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:55:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:55:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:42,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147575512] [2022-11-02 19:55:42,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147575512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:42,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:42,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:42,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471269112] [2022-11-02 19:55:42,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:42,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:42,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:42,008 INFO L87 Difference]: Start difference. First operand 966 states and 1241 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 19:55:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:44,636 INFO L93 Difference]: Finished difference Result 966 states and 1241 transitions. [2022-11-02 19:55:44,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:44,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-11-02 19:55:44,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:44,643 INFO L225 Difference]: With dead ends: 966 [2022-11-02 19:55:44,644 INFO L226 Difference]: Without dead ends: 964 [2022-11-02 19:55:44,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:44,645 INFO L413 NwaCegarLoop]: 1189 mSDtfsCounter, 1610 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2668 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:44,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 2668 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 19:55:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-11-02 19:55:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2022-11-02 19:55:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 629 states have (on average 1.2257551669316376) internal successors, (771), 666 states have internal predecessors, (771), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1239 transitions. [2022-11-02 19:55:44,716 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1239 transitions. Word has length 89 [2022-11-02 19:55:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:44,717 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1239 transitions. [2022-11-02 19:55:44,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 19:55:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1239 transitions. [2022-11-02 19:55:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 19:55:44,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:44,719 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:44,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:55:44,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:44,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1517419958, now seen corresponding path program 1 times [2022-11-02 19:55:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:44,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953826124] [2022-11-02 19:55:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:55:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:55:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:55:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953826124] [2022-11-02 19:55:45,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953826124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:45,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:45,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915726884] [2022-11-02 19:55:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:45,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:45,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:45,153 INFO L87 Difference]: Start difference. First operand 964 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 19:55:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:47,728 INFO L93 Difference]: Finished difference Result 964 states and 1239 transitions. [2022-11-02 19:55:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:47,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-11-02 19:55:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:47,736 INFO L225 Difference]: With dead ends: 964 [2022-11-02 19:55:47,736 INFO L226 Difference]: Without dead ends: 962 [2022-11-02 19:55:47,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:47,738 INFO L413 NwaCegarLoop]: 1187 mSDtfsCounter, 1604 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:47,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 2666 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 19:55:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-02 19:55:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-02 19:55:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 628 states have (on average 1.2245222929936306) internal successors, (769), 664 states have internal predecessors, (769), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1237 transitions. [2022-11-02 19:55:47,809 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1237 transitions. Word has length 95 [2022-11-02 19:55:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:47,810 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1237 transitions. [2022-11-02 19:55:47,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 19:55:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1237 transitions. [2022-11-02 19:55:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 19:55:47,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:47,812 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:47,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 19:55:47,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash 179646454, now seen corresponding path program 1 times [2022-11-02 19:55:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:47,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605190013] [2022-11-02 19:55:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:55:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:55:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:55:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:55:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:48,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:48,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605190013] [2022-11-02 19:55:48,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605190013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:48,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:48,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:48,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10816718] [2022-11-02 19:55:48,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:48,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:48,247 INFO L87 Difference]: Start difference. First operand 962 states and 1237 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 19:55:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:50,783 INFO L93 Difference]: Finished difference Result 962 states and 1237 transitions. [2022-11-02 19:55:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-11-02 19:55:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:50,791 INFO L225 Difference]: With dead ends: 962 [2022-11-02 19:55:50,791 INFO L226 Difference]: Without dead ends: 960 [2022-11-02 19:55:50,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:50,795 INFO L413 NwaCegarLoop]: 1185 mSDtfsCounter, 1598 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:50,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 2664 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 19:55:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-11-02 19:55:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2022-11-02 19:55:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 627 states have (on average 1.223285486443381) internal successors, (767), 662 states have internal predecessors, (767), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1235 transitions. [2022-11-02 19:55:50,870 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1235 transitions. Word has length 101 [2022-11-02 19:55:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:50,871 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1235 transitions. [2022-11-02 19:55:50,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 19:55:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1235 transitions. [2022-11-02 19:55:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 19:55:50,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:50,874 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:50,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 19:55:50,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash -862139684, now seen corresponding path program 1 times [2022-11-02 19:55:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:50,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801295652] [2022-11-02 19:55:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:55:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:55:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:55:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:55:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:55:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:51,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801295652] [2022-11-02 19:55:51,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801295652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:51,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:51,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650318226] [2022-11-02 19:55:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:51,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:51,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:51,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:51,343 INFO L87 Difference]: Start difference. First operand 960 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 19:55:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:53,603 INFO L93 Difference]: Finished difference Result 960 states and 1235 transitions. [2022-11-02 19:55:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:53,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-11-02 19:55:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:53,608 INFO L225 Difference]: With dead ends: 960 [2022-11-02 19:55:53,609 INFO L226 Difference]: Without dead ends: 958 [2022-11-02 19:55:53,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:53,610 INFO L413 NwaCegarLoop]: 1183 mSDtfsCounter, 1592 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:53,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 2662 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 19:55:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-11-02 19:55:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2022-11-02 19:55:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 626 states have (on average 1.2220447284345048) internal successors, (765), 660 states have internal predecessors, (765), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1233 transitions. [2022-11-02 19:55:53,691 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1233 transitions. Word has length 107 [2022-11-02 19:55:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:53,692 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1233 transitions. [2022-11-02 19:55:53,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 19:55:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1233 transitions. [2022-11-02 19:55:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 19:55:53,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:53,694 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:53,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 19:55:53,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash 215029627, now seen corresponding path program 1 times [2022-11-02 19:55:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:53,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616468055] [2022-11-02 19:55:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:53,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:53,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:53,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:55:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:55:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:55:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:55:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:55:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:55:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:54,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:54,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616468055] [2022-11-02 19:55:54,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616468055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:54,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:54,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069515040] [2022-11-02 19:55:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:54,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:54,121 INFO L87 Difference]: Start difference. First operand 958 states and 1233 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 19:55:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:56,474 INFO L93 Difference]: Finished difference Result 958 states and 1233 transitions. [2022-11-02 19:55:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:56,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-11-02 19:55:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:56,480 INFO L225 Difference]: With dead ends: 958 [2022-11-02 19:55:56,480 INFO L226 Difference]: Without dead ends: 956 [2022-11-02 19:55:56,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:56,482 INFO L413 NwaCegarLoop]: 1181 mSDtfsCounter, 1590 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:56,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 2660 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 19:55:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-11-02 19:55:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2022-11-02 19:55:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 625 states have (on average 1.2208) internal successors, (763), 658 states have internal predecessors, (763), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1231 transitions. [2022-11-02 19:55:56,564 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1231 transitions. Word has length 113 [2022-11-02 19:55:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:56,565 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 1231 transitions. [2022-11-02 19:55:56,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 19:55:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1231 transitions. [2022-11-02 19:55:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 19:55:56,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:56,569 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:56,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 19:55:56,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:56,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash 485176158, now seen corresponding path program 1 times [2022-11-02 19:55:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:56,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197042734] [2022-11-02 19:55:56,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:55:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:55:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:55:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:55:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:55:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:55:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197042734] [2022-11-02 19:55:56,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197042734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:56,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:56,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:57,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169162088] [2022-11-02 19:55:57,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:57,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:57,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:57,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:57,001 INFO L87 Difference]: Start difference. First operand 956 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 19:55:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:55:59,428 INFO L93 Difference]: Finished difference Result 956 states and 1231 transitions. [2022-11-02 19:55:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:55:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-11-02 19:55:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:55:59,434 INFO L225 Difference]: With dead ends: 956 [2022-11-02 19:55:59,435 INFO L226 Difference]: Without dead ends: 954 [2022-11-02 19:55:59,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:55:59,438 INFO L413 NwaCegarLoop]: 1179 mSDtfsCounter, 1578 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:55:59,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 2658 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 19:55:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-11-02 19:55:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2022-11-02 19:55:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 624 states have (on average 1.2195512820512822) internal successors, (761), 656 states have internal predecessors, (761), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:55:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1229 transitions. [2022-11-02 19:55:59,528 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1229 transitions. Word has length 115 [2022-11-02 19:55:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:55:59,528 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1229 transitions. [2022-11-02 19:55:59,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 19:55:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1229 transitions. [2022-11-02 19:55:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-02 19:55:59,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:55:59,531 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:55:59,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 19:55:59,531 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:55:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:55:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 907436211, now seen corresponding path program 1 times [2022-11-02 19:55:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:55:59,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726523923] [2022-11-02 19:55:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:55:59,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:55:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:55:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:55:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:55:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:55:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:55:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:55:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:55:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:55:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:55:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:55:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:55:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:55:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:55:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:55:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:55:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:55:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:55:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:55:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:55:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:55:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:55:59,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726523923] [2022-11-02 19:55:59,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726523923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:55:59,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:55:59,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:55:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781132802] [2022-11-02 19:55:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:55:59,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:55:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:55:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:55:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:55:59,984 INFO L87 Difference]: Start difference. First operand 954 states and 1229 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 19:56:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:02,464 INFO L93 Difference]: Finished difference Result 954 states and 1229 transitions. [2022-11-02 19:56:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-11-02 19:56:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:02,469 INFO L225 Difference]: With dead ends: 954 [2022-11-02 19:56:02,469 INFO L226 Difference]: Without dead ends: 952 [2022-11-02 19:56:02,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:02,471 INFO L413 NwaCegarLoop]: 1177 mSDtfsCounter, 1574 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:02,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 2656 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 19:56:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-11-02 19:56:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2022-11-02 19:56:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 623 states have (on average 1.218298555377207) internal successors, (759), 654 states have internal predecessors, (759), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:56:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1227 transitions. [2022-11-02 19:56:02,564 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1227 transitions. Word has length 121 [2022-11-02 19:56:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:02,565 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1227 transitions. [2022-11-02 19:56:02,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 19:56:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1227 transitions. [2022-11-02 19:56:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-02 19:56:02,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:02,568 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:02,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 19:56:02,569 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash -289800848, now seen corresponding path program 1 times [2022-11-02 19:56:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:02,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136588998] [2022-11-02 19:56:02,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:02,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:56:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:56:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:56:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:56:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:56:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:56:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:56:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 19:56:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 19:56:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:03,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136588998] [2022-11-02 19:56:03,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136588998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:03,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:03,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:56:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494428537] [2022-11-02 19:56:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:03,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:56:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:03,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:56:03,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:56:03,531 INFO L87 Difference]: Start difference. First operand 952 states and 1227 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 19:56:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:08,042 INFO L93 Difference]: Finished difference Result 1878 states and 2427 transitions. [2022-11-02 19:56:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:56:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2022-11-02 19:56:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:08,048 INFO L225 Difference]: With dead ends: 1878 [2022-11-02 19:56:08,049 INFO L226 Difference]: Without dead ends: 965 [2022-11-02 19:56:08,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-11-02 19:56:08,057 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 1892 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 4124 SdHoareTripleChecker+Invalid, 3630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:08,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 4124 Invalid, 3630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-02 19:56:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-11-02 19:56:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 952. [2022-11-02 19:56:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 623 states have (on average 1.21669341894061) internal successors, (758), 654 states have internal predecessors, (758), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:56:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1226 transitions. [2022-11-02 19:56:08,210 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1226 transitions. Word has length 164 [2022-11-02 19:56:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:08,211 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1226 transitions. [2022-11-02 19:56:08,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 19:56:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1226 transitions. [2022-11-02 19:56:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-02 19:56:08,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:08,214 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:08,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 19:56:08,215 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash -289741266, now seen corresponding path program 1 times [2022-11-02 19:56:08,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:08,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157486016] [2022-11-02 19:56:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:56:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:56:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:56:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:56:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:56:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:56:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:56:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 19:56:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 19:56:08,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:08,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157486016] [2022-11-02 19:56:08,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157486016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:08,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:08,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:56:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351117653] [2022-11-02 19:56:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:08,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:56:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:08,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:56:08,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:56:08,801 INFO L87 Difference]: Start difference. First operand 952 states and 1226 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-02 19:56:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:12,487 INFO L93 Difference]: Finished difference Result 965 states and 1247 transitions. [2022-11-02 19:56:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:56:12,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 164 [2022-11-02 19:56:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:12,493 INFO L225 Difference]: With dead ends: 965 [2022-11-02 19:56:12,493 INFO L226 Difference]: Without dead ends: 963 [2022-11-02 19:56:12,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 19:56:12,494 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 967 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 1887 mSolverCounterSat, 848 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 3693 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 848 IncrementalHoareTripleChecker+Valid, 1887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:12,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 3693 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [848 Valid, 1887 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-02 19:56:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-11-02 19:56:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 950. [2022-11-02 19:56:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 622 states have (on average 1.2154340836012862) internal successors, (756), 652 states have internal predecessors, (756), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:56:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1224 transitions. [2022-11-02 19:56:12,599 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1224 transitions. Word has length 164 [2022-11-02 19:56:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:12,600 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1224 transitions. [2022-11-02 19:56:12,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-02 19:56:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1224 transitions. [2022-11-02 19:56:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 19:56:12,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:12,602 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:12,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 19:56:12,603 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1029929949, now seen corresponding path program 1 times [2022-11-02 19:56:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:12,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668906451] [2022-11-02 19:56:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:56:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:56:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:56:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:56:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:56:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:56:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:56:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:13,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:56:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:56:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:56:13,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:13,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668906451] [2022-11-02 19:56:13,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668906451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:13,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:13,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:13,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994013011] [2022-11-02 19:56:13,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:13,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:13,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:13,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:13,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:13,037 INFO L87 Difference]: Start difference. First operand 950 states and 1224 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 19:56:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:16,051 INFO L93 Difference]: Finished difference Result 950 states and 1224 transitions. [2022-11-02 19:56:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-11-02 19:56:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:16,055 INFO L225 Difference]: With dead ends: 950 [2022-11-02 19:56:16,056 INFO L226 Difference]: Without dead ends: 948 [2022-11-02 19:56:16,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:16,057 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 1559 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:16,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 2651 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 19:56:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2022-11-02 19:56:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2022-11-02 19:56:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 621 states have (on average 1.214170692431562) internal successors, (754), 650 states have internal predecessors, (754), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:56:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1222 transitions. [2022-11-02 19:56:16,156 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1222 transitions. Word has length 127 [2022-11-02 19:56:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:16,159 INFO L495 AbstractCegarLoop]: Abstraction has 948 states and 1222 transitions. [2022-11-02 19:56:16,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 19:56:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1222 transitions. [2022-11-02 19:56:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-02 19:56:16,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:16,163 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:16,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 19:56:16,163 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:16,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2095809396, now seen corresponding path program 1 times [2022-11-02 19:56:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:16,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592823850] [2022-11-02 19:56:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:56:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:56:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:56:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:56:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:56:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:56:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:56:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 19:56:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 19:56:16,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:16,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592823850] [2022-11-02 19:56:16,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592823850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:16,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:16,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:16,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379447730] [2022-11-02 19:56:16,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:16,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:16,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:16,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:16,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:16,605 INFO L87 Difference]: Start difference. First operand 948 states and 1222 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 19:56:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:18,981 INFO L93 Difference]: Finished difference Result 1866 states and 2413 transitions. [2022-11-02 19:56:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:18,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2022-11-02 19:56:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:18,989 INFO L225 Difference]: With dead ends: 1866 [2022-11-02 19:56:18,989 INFO L226 Difference]: Without dead ends: 957 [2022-11-02 19:56:18,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:18,993 INFO L413 NwaCegarLoop]: 1165 mSDtfsCounter, 1853 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:18,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 2445 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 19:56:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-11-02 19:56:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 944. [2022-11-02 19:56:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 618 states have (on average 1.2119741100323624) internal successors, (749), 646 states have internal predecessors, (749), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:56:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1217 transitions. [2022-11-02 19:56:19,105 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1217 transitions. Word has length 171 [2022-11-02 19:56:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:19,105 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1217 transitions. [2022-11-02 19:56:19,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 19:56:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1217 transitions. [2022-11-02 19:56:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 19:56:19,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:19,108 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:19,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 19:56:19,109 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:19,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash 664932848, now seen corresponding path program 1 times [2022-11-02 19:56:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:19,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123022264] [2022-11-02 19:56:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:56:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:56:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:56:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:56:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:56:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:56:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:56:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:56:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:56:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:56:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:56:19,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:19,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123022264] [2022-11-02 19:56:19,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123022264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:19,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:19,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142838541] [2022-11-02 19:56:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:19,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:19,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:19,503 INFO L87 Difference]: Start difference. First operand 944 states and 1217 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 19:56:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:22,003 INFO L93 Difference]: Finished difference Result 944 states and 1217 transitions. [2022-11-02 19:56:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2022-11-02 19:56:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:22,008 INFO L225 Difference]: With dead ends: 944 [2022-11-02 19:56:22,008 INFO L226 Difference]: Without dead ends: 942 [2022-11-02 19:56:22,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:22,009 INFO L413 NwaCegarLoop]: 1165 mSDtfsCounter, 1538 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:22,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 2644 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 19:56:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-11-02 19:56:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2022-11-02 19:56:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 617 states have (on average 1.2106969205834683) internal successors, (747), 644 states have internal predecessors, (747), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 19:56:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1215 transitions. [2022-11-02 19:56:22,125 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1215 transitions. Word has length 133 [2022-11-02 19:56:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:22,126 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 1215 transitions. [2022-11-02 19:56:22,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 19:56:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1215 transitions. [2022-11-02 19:56:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-02 19:56:22,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:22,129 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:22,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 19:56:22,130 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:22,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash -793485747, now seen corresponding path program 1 times [2022-11-02 19:56:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:22,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947244486] [2022-11-02 19:56:22,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:22,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 19:56:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 19:56:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 19:56:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 19:56:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:56:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 19:56:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 19:56:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-11-02 19:56:22,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:22,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947244486] [2022-11-02 19:56:22,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947244486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:22,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:22,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:56:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056466521] [2022-11-02 19:56:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:22,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:56:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:22,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:56:22,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:56:22,983 INFO L87 Difference]: Start difference. First operand 942 states and 1215 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-11-02 19:56:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:28,154 INFO L93 Difference]: Finished difference Result 1900 states and 2489 transitions. [2022-11-02 19:56:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:56:28,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2022-11-02 19:56:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:28,162 INFO L225 Difference]: With dead ends: 1900 [2022-11-02 19:56:28,162 INFO L226 Difference]: Without dead ends: 1232 [2022-11-02 19:56:28,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:56:28,166 INFO L413 NwaCegarLoop]: 1291 mSDtfsCounter, 1418 mSDsluCounter, 3902 mSDsCounter, 0 mSdLazyCounter, 3555 mSolverCounterSat, 1233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 5193 SdHoareTripleChecker+Invalid, 4788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1233 IncrementalHoareTripleChecker+Valid, 3555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:28,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 5193 Invalid, 4788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1233 Valid, 3555 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-02 19:56:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-11-02 19:56:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 947. [2022-11-02 19:56:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 621 states have (on average 1.209339774557166) internal successors, (751), 648 states have internal predecessors, (751), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2022-11-02 19:56:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1222 transitions. [2022-11-02 19:56:28,349 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1222 transitions. Word has length 167 [2022-11-02 19:56:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:28,350 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1222 transitions. [2022-11-02 19:56:28,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-11-02 19:56:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1222 transitions. [2022-11-02 19:56:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 19:56:28,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:28,352 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:28,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 19:56:28,353 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1553023, now seen corresponding path program 1 times [2022-11-02 19:56:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:28,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050033947] [2022-11-02 19:56:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:56:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:56:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:56:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:56:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:56:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:56:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:56:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:56:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:56:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:56:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:56:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:56:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050033947] [2022-11-02 19:56:28,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050033947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:28,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:28,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:28,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654259331] [2022-11-02 19:56:28,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:28,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:28,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:28,768 INFO L87 Difference]: Start difference. First operand 947 states and 1222 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 19:56:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:31,313 INFO L93 Difference]: Finished difference Result 947 states and 1222 transitions. [2022-11-02 19:56:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:31,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-11-02 19:56:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:31,319 INFO L225 Difference]: With dead ends: 947 [2022-11-02 19:56:31,319 INFO L226 Difference]: Without dead ends: 945 [2022-11-02 19:56:31,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:31,321 INFO L413 NwaCegarLoop]: 1163 mSDtfsCounter, 1532 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:31,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 2642 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 19:56:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-11-02 19:56:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2022-11-02 19:56:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 620 states have (on average 1.2080645161290322) internal successors, (749), 646 states have internal predecessors, (749), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2022-11-02 19:56:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1220 transitions. [2022-11-02 19:56:31,524 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1220 transitions. Word has length 139 [2022-11-02 19:56:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:31,524 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1220 transitions. [2022-11-02 19:56:31,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 19:56:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1220 transitions. [2022-11-02 19:56:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 19:56:31,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:31,527 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:31,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 19:56:31,528 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash 155827134, now seen corresponding path program 1 times [2022-11-02 19:56:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:31,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718296963] [2022-11-02 19:56:31,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:56:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:56:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:56:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:56:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:56:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:56:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:56:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:56:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:56:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:32,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:56:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:56:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:56:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:56:32,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:32,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718296963] [2022-11-02 19:56:32,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718296963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:32,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:32,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239895469] [2022-11-02 19:56:32,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:32,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:32,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:32,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:32,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:32,058 INFO L87 Difference]: Start difference. First operand 945 states and 1220 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 19:56:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:34,658 INFO L93 Difference]: Finished difference Result 945 states and 1220 transitions. [2022-11-02 19:56:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:34,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-11-02 19:56:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:34,664 INFO L225 Difference]: With dead ends: 945 [2022-11-02 19:56:34,664 INFO L226 Difference]: Without dead ends: 943 [2022-11-02 19:56:34,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:34,666 INFO L413 NwaCegarLoop]: 1161 mSDtfsCounter, 1526 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:34,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 2640 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 19:56:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-11-02 19:56:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2022-11-02 19:56:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 619 states have (on average 1.2067851373182552) internal successors, (747), 644 states have internal predecessors, (747), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2022-11-02 19:56:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1218 transitions. [2022-11-02 19:56:34,856 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1218 transitions. Word has length 145 [2022-11-02 19:56:34,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:34,856 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1218 transitions. [2022-11-02 19:56:34,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 19:56:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1218 transitions. [2022-11-02 19:56:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-11-02 19:56:34,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:34,860 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:34,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 19:56:34,860 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -190426035, now seen corresponding path program 1 times [2022-11-02 19:56:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:34,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480912697] [2022-11-02 19:56:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 19:56:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 19:56:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 19:56:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 19:56:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:56:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 19:56:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 19:56:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:56:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 19:56:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-11-02 19:56:35,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:35,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480912697] [2022-11-02 19:56:35,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480912697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:35,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:35,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:56:35,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577652648] [2022-11-02 19:56:35,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:35,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:56:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:35,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:56:35,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:56:35,747 INFO L87 Difference]: Start difference. First operand 943 states and 1218 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 19:56:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:39,640 INFO L93 Difference]: Finished difference Result 1056 states and 1337 transitions. [2022-11-02 19:56:39,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 19:56:39,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 183 [2022-11-02 19:56:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:39,647 INFO L225 Difference]: With dead ends: 1056 [2022-11-02 19:56:39,647 INFO L226 Difference]: Without dead ends: 1054 [2022-11-02 19:56:39,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 19:56:39,649 INFO L413 NwaCegarLoop]: 1190 mSDtfsCounter, 1876 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:39,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 3773 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-02 19:56:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-11-02 19:56:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1037. [2022-11-02 19:56:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 682 states have (on average 1.2023460410557185) internal successors, (820), 707 states have internal predecessors, (820), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2022-11-02 19:56:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1315 transitions. [2022-11-02 19:56:39,797 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1315 transitions. Word has length 183 [2022-11-02 19:56:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:39,798 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1315 transitions. [2022-11-02 19:56:39,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 19:56:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1315 transitions. [2022-11-02 19:56:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-02 19:56:39,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:39,801 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:39,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 19:56:39,801 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 28 more)] === [2022-11-02 19:56:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1747305839, now seen corresponding path program 1 times [2022-11-02 19:56:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:39,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049848300] [2022-11-02 19:56:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:39,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:56:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:56:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:56:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:56:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:56:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:56:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:56:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:56:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:56:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:56:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:56:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:56:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:56:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:56:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:40,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049848300] [2022-11-02 19:56:40,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049848300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:40,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:40,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212813883] [2022-11-02 19:56:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:40,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:40,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:40,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:40,286 INFO L87 Difference]: Start difference. First operand 1037 states and 1315 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 19:56:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:42,779 INFO L93 Difference]: Finished difference Result 1037 states and 1315 transitions. [2022-11-02 19:56:42,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:42,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-11-02 19:56:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:42,784 INFO L225 Difference]: With dead ends: 1037 [2022-11-02 19:56:42,784 INFO L226 Difference]: Without dead ends: 1035 [2022-11-02 19:56:42,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:42,786 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 1520 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:42,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 2638 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 19:56:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-11-02 19:56:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2022-11-02 19:56:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 681 states have (on average 1.2011747430249633) internal successors, (818), 705 states have internal predecessors, (818), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2022-11-02 19:56:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1313 transitions. [2022-11-02 19:56:42,959 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1313 transitions. Word has length 151 [2022-11-02 19:56:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:42,959 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1313 transitions. [2022-11-02 19:56:42,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 19:56:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1313 transitions. [2022-11-02 19:56:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-02 19:56:42,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:42,962 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:42,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 19:56:42,963 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1924683292, now seen corresponding path program 1 times [2022-11-02 19:56:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:42,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043287794] [2022-11-02 19:56:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:56:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:56:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:56:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:56:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:56:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:56:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:56:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 19:56:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:56:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:56:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2022-11-02 19:56:43,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:43,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043287794] [2022-11-02 19:56:43,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043287794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:43,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:43,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:43,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067533160] [2022-11-02 19:56:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:43,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:43,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:43,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:43,373 INFO L87 Difference]: Start difference. First operand 1035 states and 1313 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 19:56:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:46,051 INFO L93 Difference]: Finished difference Result 1945 states and 2449 transitions. [2022-11-02 19:56:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:56:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 199 [2022-11-02 19:56:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:46,058 INFO L225 Difference]: With dead ends: 1945 [2022-11-02 19:56:46,058 INFO L226 Difference]: Without dead ends: 1042 [2022-11-02 19:56:46,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:56:46,061 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 1832 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:46,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 2230 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 19:56:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-11-02 19:56:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1031. [2022-11-02 19:56:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 678 states have (on average 1.1991150442477876) internal successors, (813), 701 states have internal predecessors, (813), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2022-11-02 19:56:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1308 transitions. [2022-11-02 19:56:46,210 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1308 transitions. Word has length 199 [2022-11-02 19:56:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:46,211 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1308 transitions. [2022-11-02 19:56:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 19:56:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1308 transitions. [2022-11-02 19:56:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-02 19:56:46,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:46,213 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:46,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 19:56:46,214 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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 28 more)] === [2022-11-02 19:56:46,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash 794045404, now seen corresponding path program 1 times [2022-11-02 19:56:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:46,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284257942] [2022-11-02 19:56:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:46,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:56:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:56:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:56:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:56:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:56:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:56:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:56:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:56:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:56:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:56:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:56:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:56:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:56:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 19:56:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:56:46,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:46,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284257942] [2022-11-02 19:56:46,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284257942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:46,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:46,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:46,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246799498] [2022-11-02 19:56:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:46,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:46,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:46,769 INFO L87 Difference]: Start difference. First operand 1031 states and 1308 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 19:56:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:49,172 INFO L93 Difference]: Finished difference Result 1031 states and 1308 transitions. [2022-11-02 19:56:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:49,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-11-02 19:56:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:49,179 INFO L225 Difference]: With dead ends: 1031 [2022-11-02 19:56:49,179 INFO L226 Difference]: Without dead ends: 1029 [2022-11-02 19:56:49,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:49,180 INFO L413 NwaCegarLoop]: 1152 mSDtfsCounter, 1509 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:49,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 2617 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 19:56:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2022-11-02 19:56:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2022-11-02 19:56:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 677 states have (on average 1.1979320531757756) internal successors, (811), 699 states have internal predecessors, (811), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2022-11-02 19:56:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1306 transitions. [2022-11-02 19:56:49,361 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1306 transitions. Word has length 157 [2022-11-02 19:56:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:49,362 INFO L495 AbstractCegarLoop]: Abstraction has 1029 states and 1306 transitions. [2022-11-02 19:56:49,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 19:56:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1306 transitions. [2022-11-02 19:56:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-02 19:56:49,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:49,365 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-11-02 19:56:49,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 19:56:49,365 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash -8470101, now seen corresponding path program 1 times [2022-11-02 19:56:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:49,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267838943] [2022-11-02 19:56:49,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:56:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:56:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:56:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:56:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:56:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:56:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:56:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 19:56:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:56:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:56:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 19:56:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2022-11-02 19:56:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:49,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267838943] [2022-11-02 19:56:49,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267838943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:56:49,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417878232] [2022-11-02 19:56:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:49,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:56:49,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:56:49,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:56:49,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 19:56:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:50,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 19:56:50,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:56:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 19:56:50,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:56:50,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417878232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:50,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:56:50,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-11-02 19:56:50,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762005628] [2022-11-02 19:56:50,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:50,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:56:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:50,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:56:50,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:50,872 INFO L87 Difference]: Start difference. First operand 1029 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 19:56:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:51,104 INFO L93 Difference]: Finished difference Result 1975 states and 2484 transitions. [2022-11-02 19:56:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:56:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 205 [2022-11-02 19:56:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:51,112 INFO L225 Difference]: With dead ends: 1975 [2022-11-02 19:56:51,112 INFO L226 Difference]: Without dead ends: 1081 [2022-11-02 19:56:51,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:51,116 INFO L413 NwaCegarLoop]: 1261 mSDtfsCounter, 1136 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:51,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1328 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:56:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-11-02 19:56:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1078. [2022-11-02 19:56:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 706 states have (on average 1.1912181303116147) internal successors, (841), 731 states have internal predecessors, (841), 262 states have call successors, (262), 100 states have call predecessors, (262), 100 states have return successors, (263), 256 states have call predecessors, (263), 260 states have call successors, (263) [2022-11-02 19:56:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1366 transitions. [2022-11-02 19:56:51,329 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1366 transitions. Word has length 205 [2022-11-02 19:56:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:51,329 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 1366 transitions. [2022-11-02 19:56:51,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 19:56:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1366 transitions. [2022-11-02 19:56:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-02 19:56:51,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:51,333 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:56:51,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 19:56:51,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 19:56:51,549 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 28 more)] === [2022-11-02 19:56:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1444426604, now seen corresponding path program 1 times [2022-11-02 19:56:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:51,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942558202] [2022-11-02 19:56:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:56:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:56:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:56:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:56:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:56:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:56:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:56:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:56:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:56:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:56:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:56:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:56:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:56:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 19:56:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:51,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 19:56:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:56:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:52,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942558202] [2022-11-02 19:56:52,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942558202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:52,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:52,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:56:52,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865618902] [2022-11-02 19:56:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:52,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:56:52,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:56:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:56:52,003 INFO L87 Difference]: Start difference. First operand 1078 states and 1366 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-02 19:56:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:56:54,823 INFO L93 Difference]: Finished difference Result 1078 states and 1366 transitions. [2022-11-02 19:56:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:56:54,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-11-02 19:56:54,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:56:54,829 INFO L225 Difference]: With dead ends: 1078 [2022-11-02 19:56:54,830 INFO L226 Difference]: Without dead ends: 1076 [2022-11-02 19:56:54,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:56:54,831 INFO L413 NwaCegarLoop]: 1145 mSDtfsCounter, 1498 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:56:54,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 2596 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 19:56:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-11-02 19:56:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2022-11-02 19:56:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 705 states have (on average 1.1900709219858157) internal successors, (839), 729 states have internal predecessors, (839), 262 states have call successors, (262), 100 states have call predecessors, (262), 100 states have return successors, (263), 256 states have call predecessors, (263), 260 states have call successors, (263) [2022-11-02 19:56:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1364 transitions. [2022-11-02 19:56:55,044 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1364 transitions. Word has length 163 [2022-11-02 19:56:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:56:55,045 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1364 transitions. [2022-11-02 19:56:55,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-02 19:56:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1364 transitions. [2022-11-02 19:56:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-11-02 19:56:55,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:56:55,049 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 19:56:55,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 19:56:55,049 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:56:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:56:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -997022710, now seen corresponding path program 1 times [2022-11-02 19:56:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:56:55,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27155906] [2022-11-02 19:56:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:56:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:56:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:56:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:56:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:56:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:56:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:56:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:56:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:56:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:56:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 19:56:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 19:56:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 19:56:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 19:56:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:56:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:56:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:56:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 19:56:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 19:56:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:56:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 19:56:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:56:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 19:56:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:56:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-02 19:56:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:56:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-11-02 19:56:55,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:56:55,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27155906] [2022-11-02 19:56:55,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27155906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:56:55,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:56:55,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:56:55,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660024472] [2022-11-02 19:56:55,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:56:55,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:56:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:56:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:56:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:56:55,851 INFO L87 Difference]: Start difference. First operand 1076 states and 1364 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 19:57:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:01,640 INFO L93 Difference]: Finished difference Result 1758 states and 2203 transitions. [2022-11-02 19:57:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 19:57:01,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 201 [2022-11-02 19:57:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:01,648 INFO L225 Difference]: With dead ends: 1758 [2022-11-02 19:57:01,649 INFO L226 Difference]: Without dead ends: 1756 [2022-11-02 19:57:01,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-11-02 19:57:01,650 INFO L413 NwaCegarLoop]: 1526 mSDtfsCounter, 2897 mSDsluCounter, 4472 mSDsCounter, 0 mSdLazyCounter, 3273 mSolverCounterSat, 1637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3058 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 4910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1637 IncrementalHoareTripleChecker+Valid, 3273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:01,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3058 Valid, 5998 Invalid, 4910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1637 Valid, 3273 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 19:57:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-11-02 19:57:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1702. [2022-11-02 19:57:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1132 states have (on average 1.1934628975265018) internal successors, (1351), 1170 states have internal predecessors, (1351), 391 states have call successors, (391), 170 states have call predecessors, (391), 170 states have return successors, (397), 373 states have call predecessors, (397), 389 states have call successors, (397) [2022-11-02 19:57:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2139 transitions. [2022-11-02 19:57:01,960 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2139 transitions. Word has length 201 [2022-11-02 19:57:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:01,961 INFO L495 AbstractCegarLoop]: Abstraction has 1702 states and 2139 transitions. [2022-11-02 19:57:01,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 19:57:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2139 transitions. [2022-11-02 19:57:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-11-02 19:57:01,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:01,964 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:01,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 19:57:01,964 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:57:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1288414627, now seen corresponding path program 1 times [2022-11-02 19:57:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:01,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112272027] [2022-11-02 19:57:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:57:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:57:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:57:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:57:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:57:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:57:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:57:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 19:57:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 19:57:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 19:57:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 19:57:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:57:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 19:57:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 19:57:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:57:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 19:57:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 19:57:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-02 19:57:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-11-02 19:57:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:02,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112272027] [2022-11-02 19:57:02,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112272027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:02,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:02,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:57:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620758987] [2022-11-02 19:57:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:57:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:57:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:57:02,651 INFO L87 Difference]: Start difference. First operand 1702 states and 2139 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 19:57:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:07,705 INFO L93 Difference]: Finished difference Result 1729 states and 2168 transitions. [2022-11-02 19:57:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 19:57:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 201 [2022-11-02 19:57:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:07,745 INFO L225 Difference]: With dead ends: 1729 [2022-11-02 19:57:07,745 INFO L226 Difference]: Without dead ends: 1727 [2022-11-02 19:57:07,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-11-02 19:57:07,747 INFO L413 NwaCegarLoop]: 1185 mSDtfsCounter, 1454 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 1218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 4625 SdHoareTripleChecker+Invalid, 4017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1218 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:07,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 4625 Invalid, 4017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1218 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 19:57:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-11-02 19:57:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1693. [2022-11-02 19:57:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1127 states have (on average 1.1925465838509317) internal successors, (1344), 1164 states have internal predecessors, (1344), 387 states have call successors, (387), 169 states have call predecessors, (387), 170 states have return successors, (393), 371 states have call predecessors, (393), 385 states have call successors, (393) [2022-11-02 19:57:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2124 transitions. [2022-11-02 19:57:08,104 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2124 transitions. Word has length 201 [2022-11-02 19:57:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:08,104 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 2124 transitions. [2022-11-02 19:57:08,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 19:57:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2124 transitions. [2022-11-02 19:57:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-02 19:57:08,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:08,108 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:08,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 19:57:08,108 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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 28 more)] === [2022-11-02 19:57:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash -15982876, now seen corresponding path program 1 times [2022-11-02 19:57:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:08,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335605869] [2022-11-02 19:57:08,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:08,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:57:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:57:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:57:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:57:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:57:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:57:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:57:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:57:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:57:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:57:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:57:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:57:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:57:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:57:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:57:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:57:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:57:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:57:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:57:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:57:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 19:57:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 19:57:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 19:57:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:57:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:08,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335605869] [2022-11-02 19:57:08,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335605869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:08,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:08,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:57:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789866984] [2022-11-02 19:57:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:08,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:57:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:57:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:57:08,498 INFO L87 Difference]: Start difference. First operand 1693 states and 2124 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 19:57:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:10,974 INFO L93 Difference]: Finished difference Result 1693 states and 2124 transitions. [2022-11-02 19:57:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:57:10,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-11-02 19:57:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:10,979 INFO L225 Difference]: With dead ends: 1693 [2022-11-02 19:57:10,980 INFO L226 Difference]: Without dead ends: 1691 [2022-11-02 19:57:10,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:57:10,981 INFO L413 NwaCegarLoop]: 1143 mSDtfsCounter, 1492 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:10,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 2594 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 19:57:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-11-02 19:57:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1691. [2022-11-02 19:57:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1126 states have (on average 1.1909413854351687) internal successors, (1341), 1162 states have internal predecessors, (1341), 387 states have call successors, (387), 169 states have call predecessors, (387), 170 states have return successors, (393), 371 states have call predecessors, (393), 385 states have call successors, (393) [2022-11-02 19:57:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2121 transitions. [2022-11-02 19:57:11,222 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2121 transitions. Word has length 169 [2022-11-02 19:57:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:11,223 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2121 transitions. [2022-11-02 19:57:11,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 19:57:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2121 transitions. [2022-11-02 19:57:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-02 19:57:11,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:11,226 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:11,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 19:57:11,227 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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 28 more)] === [2022-11-02 19:57:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1811664176, now seen corresponding path program 1 times [2022-11-02 19:57:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:11,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495620938] [2022-11-02 19:57:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:57:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:57:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:57:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:57:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:57:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:57:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:57:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:57:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:57:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:57:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:57:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:57:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:57:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:57:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:57:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:57:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:57:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:57:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:57:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:57:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 19:57:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 19:57:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 19:57:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 19:57:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:57:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:11,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495620938] [2022-11-02 19:57:11,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495620938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:11,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:11,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:57:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294490510] [2022-11-02 19:57:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:11,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:57:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:11,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:57:11,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:57:11,666 INFO L87 Difference]: Start difference. First operand 1691 states and 2121 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 19:57:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:14,106 INFO L93 Difference]: Finished difference Result 1691 states and 2121 transitions. [2022-11-02 19:57:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:57:14,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-11-02 19:57:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:14,112 INFO L225 Difference]: With dead ends: 1691 [2022-11-02 19:57:14,113 INFO L226 Difference]: Without dead ends: 1689 [2022-11-02 19:57:14,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:57:14,115 INFO L413 NwaCegarLoop]: 1141 mSDtfsCounter, 1486 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:14,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 2592 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 19:57:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2022-11-02 19:57:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1689. [2022-11-02 19:57:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1125 states have (on average 1.1893333333333334) internal successors, (1338), 1160 states have internal predecessors, (1338), 387 states have call successors, (387), 169 states have call predecessors, (387), 170 states have return successors, (393), 371 states have call predecessors, (393), 385 states have call successors, (393) [2022-11-02 19:57:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2118 transitions. [2022-11-02 19:57:14,473 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2118 transitions. Word has length 175 [2022-11-02 19:57:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:14,474 INFO L495 AbstractCegarLoop]: Abstraction has 1689 states and 2118 transitions. [2022-11-02 19:57:14,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 19:57:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2118 transitions. [2022-11-02 19:57:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-11-02 19:57:14,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:14,478 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-11-02 19:57:14,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 19:57:14,478 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:57:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash 660661691, now seen corresponding path program 1 times [2022-11-02 19:57:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:14,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902812761] [2022-11-02 19:57:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:57:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:57:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:57:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:57:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:57:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:57:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:57:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:57:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:57:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 19:57:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:57:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:57:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-02 19:57:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-02 19:57:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-02 19:57:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2022-11-02 19:57:15,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:15,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902812761] [2022-11-02 19:57:15,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902812761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:15,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:15,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:57:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081245096] [2022-11-02 19:57:15,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:15,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:57:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:15,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:57:15,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:57:15,635 INFO L87 Difference]: Start difference. First operand 1689 states and 2118 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-02 19:57:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:24,466 INFO L93 Difference]: Finished difference Result 4047 states and 5296 transitions. [2022-11-02 19:57:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 19:57:24,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 3 states have call successors, (25) Word has length 221 [2022-11-02 19:57:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:24,476 INFO L225 Difference]: With dead ends: 4047 [2022-11-02 19:57:24,477 INFO L226 Difference]: Without dead ends: 2452 [2022-11-02 19:57:24,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:57:24,482 INFO L413 NwaCegarLoop]: 1698 mSDtfsCounter, 1515 mSDsluCounter, 8588 mSDsCounter, 0 mSdLazyCounter, 6085 mSolverCounterSat, 1253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 10286 SdHoareTripleChecker+Invalid, 7338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1253 IncrementalHoareTripleChecker+Valid, 6085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:24,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 10286 Invalid, 7338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1253 Valid, 6085 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-02 19:57:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2022-11-02 19:57:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1696. [2022-11-02 19:57:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1130 states have (on average 1.188495575221239) internal successors, (1343), 1164 states have internal predecessors, (1343), 388 states have call successors, (388), 169 states have call predecessors, (388), 171 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-11-02 19:57:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2129 transitions. [2022-11-02 19:57:24,794 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2129 transitions. Word has length 221 [2022-11-02 19:57:24,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:24,795 INFO L495 AbstractCegarLoop]: Abstraction has 1696 states and 2129 transitions. [2022-11-02 19:57:24,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-02 19:57:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2129 transitions. [2022-11-02 19:57:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-11-02 19:57:24,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:24,798 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:24,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 19:57:24,799 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:57:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1397956039, now seen corresponding path program 1 times [2022-11-02 19:57:24,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:24,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330849325] [2022-11-02 19:57:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:57:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:57:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:57:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:57:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:57:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:57:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:57:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:57:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:57:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:57:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:57:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:57:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:57:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:57:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:57:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:57:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:57:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:57:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:57:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:57:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 19:57:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 19:57:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 19:57:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 19:57:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 19:57:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:57:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:25,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330849325] [2022-11-02 19:57:25,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330849325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:25,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:25,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:57:25,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444458945] [2022-11-02 19:57:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:25,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:57:25,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:57:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:57:25,219 INFO L87 Difference]: Start difference. First operand 1696 states and 2129 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 19:57:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:27,643 INFO L93 Difference]: Finished difference Result 1696 states and 2129 transitions. [2022-11-02 19:57:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:57:27,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-11-02 19:57:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:27,650 INFO L225 Difference]: With dead ends: 1696 [2022-11-02 19:57:27,650 INFO L226 Difference]: Without dead ends: 1694 [2022-11-02 19:57:27,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:57:27,652 INFO L413 NwaCegarLoop]: 1139 mSDtfsCounter, 1480 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:27,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 2590 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 19:57:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2022-11-02 19:57:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1694. [2022-11-02 19:57:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1129 states have (on average 1.1868910540301152) internal successors, (1340), 1162 states have internal predecessors, (1340), 388 states have call successors, (388), 169 states have call predecessors, (388), 171 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-11-02 19:57:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2126 transitions. [2022-11-02 19:57:27,994 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2126 transitions. Word has length 181 [2022-11-02 19:57:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:27,995 INFO L495 AbstractCegarLoop]: Abstraction has 1694 states and 2126 transitions. [2022-11-02 19:57:27,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 19:57:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2126 transitions. [2022-11-02 19:57:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-02 19:57:27,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:27,999 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-11-02 19:57:27,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 19:57:27,999 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:57:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2021105733, now seen corresponding path program 1 times [2022-11-02 19:57:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:28,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51012586] [2022-11-02 19:57:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:29,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:57:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:29,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:57:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:57:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:57:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:57:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:57:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:57:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:57:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:57:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 19:57:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:57:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:57:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 19:57:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 19:57:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 19:57:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-02 19:57:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-02 19:57:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-11-02 19:57:30,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:30,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51012586] [2022-11-02 19:57:30,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51012586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:30,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:30,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-02 19:57:30,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376985847] [2022-11-02 19:57:30,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:30,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 19:57:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:30,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 19:57:30,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-11-02 19:57:30,495 INFO L87 Difference]: Start difference. First operand 1694 states and 2126 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 11 states have internal predecessors, (84), 6 states have call successors, (30), 7 states have call predecessors, (30), 4 states have return successors, (28), 7 states have call predecessors, (28), 5 states have call successors, (28) [2022-11-02 19:57:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:47,246 INFO L93 Difference]: Finished difference Result 4641 states and 6240 transitions. [2022-11-02 19:57:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 19:57:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 11 states have internal predecessors, (84), 6 states have call successors, (30), 7 states have call predecessors, (30), 4 states have return successors, (28), 7 states have call predecessors, (28), 5 states have call successors, (28) Word has length 237 [2022-11-02 19:57:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:47,259 INFO L225 Difference]: With dead ends: 4641 [2022-11-02 19:57:47,260 INFO L226 Difference]: Without dead ends: 3135 [2022-11-02 19:57:47,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2022-11-02 19:57:47,266 INFO L413 NwaCegarLoop]: 2294 mSDtfsCounter, 1999 mSDsluCounter, 20802 mSDsCounter, 0 mSdLazyCounter, 12951 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 23096 SdHoareTripleChecker+Invalid, 14282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 12951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:47,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2330 Valid, 23096 Invalid, 14282 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1331 Valid, 12951 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2022-11-02 19:57:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2022-11-02 19:57:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 1712. [2022-11-02 19:57:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1138 states have (on average 1.1854130052724077) internal successors, (1349), 1172 states have internal predecessors, (1349), 395 states have call successors, (395), 170 states have call predecessors, (395), 173 states have return successors, (406), 381 states have call predecessors, (406), 393 states have call successors, (406) [2022-11-02 19:57:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2150 transitions. [2022-11-02 19:57:47,799 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2150 transitions. Word has length 237 [2022-11-02 19:57:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:47,800 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2150 transitions. [2022-11-02 19:57:47,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 11 states have internal predecessors, (84), 6 states have call successors, (30), 7 states have call predecessors, (30), 4 states have return successors, (28), 7 states have call predecessors, (28), 5 states have call successors, (28) [2022-11-02 19:57:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2150 transitions. [2022-11-02 19:57:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-02 19:57:47,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:47,803 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:57:47,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 19:57:47,804 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:57:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 11495463, now seen corresponding path program 1 times [2022-11-02 19:57:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:47,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278837385] [2022-11-02 19:57:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:57:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:57:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:57:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 19:57:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 19:57:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 19:57:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 19:57:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 19:57:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:57:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:57:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 19:57:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 19:57:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 19:57:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 19:57:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 19:57:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 19:57:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 19:57:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 19:57:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 19:57:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:57:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 19:57:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 19:57:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 19:57:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 19:57:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 19:57:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 19:57:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 19:57:48,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:48,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278837385] [2022-11-02 19:57:48,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278837385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:48,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:57:48,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:57:48,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631267828] [2022-11-02 19:57:48,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:48,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:57:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:48,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:57:48,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:57:48,218 INFO L87 Difference]: Start difference. First operand 1712 states and 2150 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-02 19:57:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:53,040 INFO L93 Difference]: Finished difference Result 3300 states and 4141 transitions. [2022-11-02 19:57:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:57:53,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-11-02 19:57:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:53,055 INFO L225 Difference]: With dead ends: 3300 [2022-11-02 19:57:53,055 INFO L226 Difference]: Without dead ends: 3017 [2022-11-02 19:57:53,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:57:53,060 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 1999 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 1143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1143 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:53,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 3480 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1143 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-02 19:57:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2022-11-02 19:57:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2998. [2022-11-02 19:57:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2003 states have (on average 1.2001997004493261) internal successors, (2404), 2058 states have internal predecessors, (2404), 689 states have call successors, (689), 294 states have call predecessors, (689), 300 states have return successors, (721), 665 states have call predecessors, (721), 687 states have call successors, (721) [2022-11-02 19:57:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3814 transitions. [2022-11-02 19:57:53,813 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3814 transitions. Word has length 187 [2022-11-02 19:57:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:53,814 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 3814 transitions. [2022-11-02 19:57:53,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-02 19:57:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3814 transitions. [2022-11-02 19:57:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-02 19:57:53,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:53,818 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-11-02 19:57:53,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 19:57:53,818 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:57:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:57:53,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2017815336, now seen corresponding path program 1 times [2022-11-02 19:57:53,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:57:53,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956486680] [2022-11-02 19:57:53,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:53,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:57:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:57:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:57:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:57:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:57:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:57:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:57:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:57:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:57:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:57:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:57:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:57:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 19:57:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:57:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:57:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:57:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:57:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 19:57:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:57:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 19:57:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 19:57:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-02 19:57:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-02 19:57:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2022-11-02 19:57:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:57:55,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956486680] [2022-11-02 19:57:55,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956486680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:57:55,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493868954] [2022-11-02 19:57:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:57:55,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:57:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:57:55,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:57:55,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 19:57:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:57:56,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 2422 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 19:57:56,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:57:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2022-11-02 19:57:56,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:57:56,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493868954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:57:56,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:57:56,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2022-11-02 19:57:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731037363] [2022-11-02 19:57:56,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:57:56,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:57:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:57:56,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:57:56,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:57:56,906 INFO L87 Difference]: Start difference. First operand 2998 states and 3814 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-11-02 19:57:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:57:58,863 INFO L93 Difference]: Finished difference Result 7079 states and 9318 transitions. [2022-11-02 19:57:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:57:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 241 [2022-11-02 19:57:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:57:58,879 INFO L225 Difference]: With dead ends: 7079 [2022-11-02 19:57:58,879 INFO L226 Difference]: Without dead ends: 4126 [2022-11-02 19:57:58,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-02 19:57:58,889 INFO L413 NwaCegarLoop]: 1279 mSDtfsCounter, 590 mSDsluCounter, 4842 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 6121 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:57:58,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 6121 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:57:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2022-11-02 19:57:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 2966. [2022-11-02 19:57:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 1986 states have (on average 1.200402819738167) internal successors, (2384), 2038 states have internal predecessors, (2384), 677 states have call successors, (677), 291 states have call predecessors, (677), 297 states have return successors, (709), 654 states have call predecessors, (709), 675 states have call successors, (709) [2022-11-02 19:57:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 3770 transitions. [2022-11-02 19:57:59,790 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 3770 transitions. Word has length 241 [2022-11-02 19:57:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:57:59,790 INFO L495 AbstractCegarLoop]: Abstraction has 2966 states and 3770 transitions. [2022-11-02 19:57:59,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-11-02 19:57:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 3770 transitions. [2022-11-02 19:57:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-02 19:57:59,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:57:59,794 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-11-02 19:57:59,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 19:58:00,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:58:00,009 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:58:00,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1386077338, now seen corresponding path program 1 times [2022-11-02 19:58:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:00,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424767541] [2022-11-02 19:58:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:58:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:58:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:58:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:58:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:58:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:58:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:58:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:58:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:58:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:01,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:58:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:58:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 19:58:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:58:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:58:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:58:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 19:58:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:58:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 19:58:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 19:58:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-02 19:58:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-02 19:58:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2022-11-02 19:58:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:02,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424767541] [2022-11-02 19:58:02,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424767541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:58:02,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922719677] [2022-11-02 19:58:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:02,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:58:02,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:58:02,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:58:02,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 19:58:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:03,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 2420 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 19:58:03,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:58:03,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 19:58:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-11-02 19:58:03,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:58:03,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922719677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:58:03,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:58:03,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2022-11-02 19:58:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184502371] [2022-11-02 19:58:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:58:03,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:58:03,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:03,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:58:03,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-11-02 19:58:03,422 INFO L87 Difference]: Start difference. First operand 2966 states and 3770 transitions. Second operand has 9 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 19:58:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:58:11,638 INFO L93 Difference]: Finished difference Result 6724 states and 8798 transitions. [2022-11-02 19:58:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:58:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 241 [2022-11-02 19:58:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:58:11,654 INFO L225 Difference]: With dead ends: 6724 [2022-11-02 19:58:11,654 INFO L226 Difference]: Without dead ends: 3977 [2022-11-02 19:58:11,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-11-02 19:58:11,663 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 522 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 4957 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 5266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 4957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:58:11,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 4142 Invalid, 5266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 4957 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-02 19:58:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2022-11-02 19:58:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3048. [2022-11-02 19:58:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2030 states have (on average 1.199014778325123) internal successors, (2434), 2088 states have internal predecessors, (2434), 707 states have call successors, (707), 293 states have call predecessors, (707), 305 states have return successors, (760), 684 states have call predecessors, (760), 705 states have call successors, (760) [2022-11-02 19:58:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3901 transitions. [2022-11-02 19:58:12,240 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3901 transitions. Word has length 241 [2022-11-02 19:58:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:58:12,241 INFO L495 AbstractCegarLoop]: Abstraction has 3048 states and 3901 transitions. [2022-11-02 19:58:12,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 19:58:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3901 transitions. [2022-11-02 19:58:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-02 19:58:12,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:58:12,244 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-11-02 19:58:12,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 19:58:12,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:58:12,461 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-02 19:58:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:58:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1779104348, now seen corresponding path program 1 times [2022-11-02 19:58:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:58:12,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961285835] [2022-11-02 19:58:12,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:58:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:58:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 19:58:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:58:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:58:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:58:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 19:58:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 19:58:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:58:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:58:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 19:58:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 19:58:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 19:58:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:58:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 19:58:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:58:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:58:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:58:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:58:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 19:58:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:58:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 19:58:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 19:58:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-02 19:58:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-02 19:58:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2022-11-02 19:58:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:58:14,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961285835] [2022-11-02 19:58:14,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961285835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:58:14,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114300489] [2022-11-02 19:58:14,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:58:14,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:58:14,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:58:14,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:58:14,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41de1854-c058-49c2-8cbf-3877dbe0be9f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 19:58:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:58:17,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 2415 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 19:58:17,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:58:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 219 proven. 3 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-11-02 19:58:17,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:58:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2022-11-02 19:58:18,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114300489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:58:18,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:58:18,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 19 [2022-11-02 19:58:18,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612380183] [2022-11-02 19:58:18,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:58:18,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 19:58:18,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:58:18,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 19:58:18,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-11-02 19:58:18,222 INFO L87 Difference]: Start difference. First operand 3048 states and 3901 transitions. Second operand has 19 states, 17 states have (on average 9.352941176470589) internal successors, (159), 13 states have internal predecessors, (159), 6 states have call successors, (69), 6 states have call predecessors, (69), 5 states have return successors, (59), 6 states have call predecessors, (59), 6 states have call successors, (59)