./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3999042d9cc74b4d3f513a03b2b33730a93b6921729afd52c1fac5c320bfa594 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:29:48,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:29:48,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:29:48,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:29:48,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:29:48,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:29:48,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:29:48,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:29:48,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:29:48,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:29:48,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:29:48,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:29:48,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:29:48,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:29:48,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:29:48,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:29:48,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:29:48,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:29:48,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:29:48,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:29:48,852 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:29:48,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:29:48,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:29:48,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:29:48,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:29:48,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:29:48,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:29:48,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:29:48,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:29:48,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:29:48,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:29:48,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:29:48,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:29:48,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:29:48,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:29:48,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:29:48,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:29:48,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:29:48,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:29:48,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:29:48,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:29:48,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:29:48,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:29:48,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:29:48,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:29:48,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:29:48,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:29:48,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:29:48,904 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:29:48,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:29:48,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:29:48,904 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:29:48,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:29:48,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:29:48,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:29:48,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:29:48,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:29:48,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:29:48,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:29:48,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:29:48,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:29:48,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:29:48,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:29:48,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:29:48,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:29:48,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:29:48,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:29:48,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:29:48,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:29:48,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:29:48,909 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:29:48,909 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:29:48,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:29:48,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3999042d9cc74b4d3f513a03b2b33730a93b6921729afd52c1fac5c320bfa594 [2022-07-23 04:29:49,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:29:49,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:29:49,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:29:49,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:29:49,186 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:29:49,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i [2022-07-23 04:29:49,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e31f237d/3dcde309ec144fc8ba48fc9a094dfd53/FLAGc7071c424 [2022-07-23 04:29:49,939 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:29:49,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i [2022-07-23 04:29:49,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e31f237d/3dcde309ec144fc8ba48fc9a094dfd53/FLAGc7071c424 [2022-07-23 04:29:50,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e31f237d/3dcde309ec144fc8ba48fc9a094dfd53 [2022-07-23 04:29:50,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:29:50,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:29:50,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:29:50,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:29:50,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:29:50,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:29:50" (1/1) ... [2022-07-23 04:29:50,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1fc900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:50, skipping insertion in model container [2022-07-23 04:29:50,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:29:50" (1/1) ... [2022-07-23 04:29:50,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:29:50,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:29:52,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234663,234676] [2022-07-23 04:29:52,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234808,234821] [2022-07-23 04:29:52,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234954,234967] [2022-07-23 04:29:52,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235119,235132] [2022-07-23 04:29:52,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235277,235290] [2022-07-23 04:29:52,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235435,235448] [2022-07-23 04:29:52,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235593,235606] [2022-07-23 04:29:52,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235753,235766] [2022-07-23 04:29:52,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235912,235925] [2022-07-23 04:29:52,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236051,236064] [2022-07-23 04:29:52,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236193,236206] [2022-07-23 04:29:52,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236342,236355] [2022-07-23 04:29:52,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236481,236494] [2022-07-23 04:29:52,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236636,236649] [2022-07-23 04:29:52,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236796,236809] [2022-07-23 04:29:52,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236947,236960] [2022-07-23 04:29:52,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237098,237111] [2022-07-23 04:29:52,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237250,237263] [2022-07-23 04:29:52,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237399,237412] [2022-07-23 04:29:52,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237547,237560] [2022-07-23 04:29:52,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237704,237717] [2022-07-23 04:29:52,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237853,237866] [2022-07-23 04:29:52,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238009,238022] [2022-07-23 04:29:52,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238162,238175] [2022-07-23 04:29:52,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238308,238321] [2022-07-23 04:29:52,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238451,238464] [2022-07-23 04:29:52,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238603,238616] [2022-07-23 04:29:52,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238749,238762] [2022-07-23 04:29:52,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238894,238907] [2022-07-23 04:29:52,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239048,239061] [2022-07-23 04:29:52,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239199,239212] [2022-07-23 04:29:52,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239354,239367] [2022-07-23 04:29:52,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239506,239519] [2022-07-23 04:29:52,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239661,239674] [2022-07-23 04:29:52,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239825,239838] [2022-07-23 04:29:52,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239981,239994] [2022-07-23 04:29:52,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240145,240158] [2022-07-23 04:29:52,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240287,240300] [2022-07-23 04:29:52,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240445,240458] [2022-07-23 04:29:52,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240612,240625] [2022-07-23 04:29:52,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240771,240784] [2022-07-23 04:29:52,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240930,240943] [2022-07-23 04:29:52,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241079,241092] [2022-07-23 04:29:52,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241226,241239] [2022-07-23 04:29:52,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241365,241378] [2022-07-23 04:29:52,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241528,241541] [2022-07-23 04:29:52,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241694,241707] [2022-07-23 04:29:52,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241858,241871] [2022-07-23 04:29:52,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242023,242036] [2022-07-23 04:29:52,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242188,242201] [2022-07-23 04:29:52,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242354,242367] [2022-07-23 04:29:52,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242519,242532] [2022-07-23 04:29:52,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242686,242699] [2022-07-23 04:29:52,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242846,242859] [2022-07-23 04:29:52,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243008,243021] [2022-07-23 04:29:52,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243167,243180] [2022-07-23 04:29:52,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243313,243326] [2022-07-23 04:29:52,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243456,243469] [2022-07-23 04:29:52,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243600,243613] [2022-07-23 04:29:52,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243743,243756] [2022-07-23 04:29:52,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243887,243900] [2022-07-23 04:29:52,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244028,244041] [2022-07-23 04:29:52,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244166,244179] [2022-07-23 04:29:52,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244324,244337] [2022-07-23 04:29:52,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244483,244496] [2022-07-23 04:29:52,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244639,244652] [2022-07-23 04:29:52,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244788,244801] [2022-07-23 04:29:52,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244940,244953] [2022-07-23 04:29:52,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245091,245104] [2022-07-23 04:29:52,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245240,245253] [2022-07-23 04:29:52,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245392,245405] [2022-07-23 04:29:52,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245540,245553] [2022-07-23 04:29:52,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245693,245706] [2022-07-23 04:29:52,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245844,245857] [2022-07-23 04:29:52,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245994,246007] [2022-07-23 04:29:52,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246141,246154] [2022-07-23 04:29:52,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246292,246305] [2022-07-23 04:29:52,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246443,246456] [2022-07-23 04:29:52,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246591,246604] [2022-07-23 04:29:52,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246757,246770] [2022-07-23 04:29:52,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246926,246939] [2022-07-23 04:29:52,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247093,247106] [2022-07-23 04:29:52,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247261,247274] [2022-07-23 04:29:52,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247411,247424] [2022-07-23 04:29:52,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247558,247571] [2022-07-23 04:29:52,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247719,247732] [2022-07-23 04:29:52,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247889,247902] [2022-07-23 04:29:52,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[248051,248064] [2022-07-23 04:29:52,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:29:52,275 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:29:52,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234663,234676] [2022-07-23 04:29:52,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234808,234821] [2022-07-23 04:29:52,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[234954,234967] [2022-07-23 04:29:52,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235119,235132] [2022-07-23 04:29:52,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235277,235290] [2022-07-23 04:29:52,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235435,235448] [2022-07-23 04:29:52,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235593,235606] [2022-07-23 04:29:52,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235753,235766] [2022-07-23 04:29:52,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[235912,235925] [2022-07-23 04:29:52,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236051,236064] [2022-07-23 04:29:52,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236193,236206] [2022-07-23 04:29:52,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236342,236355] [2022-07-23 04:29:52,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236481,236494] [2022-07-23 04:29:52,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236636,236649] [2022-07-23 04:29:52,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236796,236809] [2022-07-23 04:29:52,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[236947,236960] [2022-07-23 04:29:52,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237098,237111] [2022-07-23 04:29:52,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237250,237263] [2022-07-23 04:29:52,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237399,237412] [2022-07-23 04:29:52,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237547,237560] [2022-07-23 04:29:52,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237704,237717] [2022-07-23 04:29:52,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[237853,237866] [2022-07-23 04:29:52,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238009,238022] [2022-07-23 04:29:52,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238162,238175] [2022-07-23 04:29:52,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238308,238321] [2022-07-23 04:29:52,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238451,238464] [2022-07-23 04:29:52,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238603,238616] [2022-07-23 04:29:52,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238749,238762] [2022-07-23 04:29:52,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[238894,238907] [2022-07-23 04:29:52,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239048,239061] [2022-07-23 04:29:52,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239199,239212] [2022-07-23 04:29:52,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239354,239367] [2022-07-23 04:29:52,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239506,239519] [2022-07-23 04:29:52,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239661,239674] [2022-07-23 04:29:52,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239825,239838] [2022-07-23 04:29:52,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[239981,239994] [2022-07-23 04:29:52,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240145,240158] [2022-07-23 04:29:52,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240287,240300] [2022-07-23 04:29:52,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240445,240458] [2022-07-23 04:29:52,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240612,240625] [2022-07-23 04:29:52,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240771,240784] [2022-07-23 04:29:52,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[240930,240943] [2022-07-23 04:29:52,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241079,241092] [2022-07-23 04:29:52,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241226,241239] [2022-07-23 04:29:52,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241365,241378] [2022-07-23 04:29:52,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241528,241541] [2022-07-23 04:29:52,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241694,241707] [2022-07-23 04:29:52,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[241858,241871] [2022-07-23 04:29:52,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242023,242036] [2022-07-23 04:29:52,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242188,242201] [2022-07-23 04:29:52,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242354,242367] [2022-07-23 04:29:52,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242519,242532] [2022-07-23 04:29:52,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242686,242699] [2022-07-23 04:29:52,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[242846,242859] [2022-07-23 04:29:52,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243008,243021] [2022-07-23 04:29:52,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243167,243180] [2022-07-23 04:29:52,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243313,243326] [2022-07-23 04:29:52,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243456,243469] [2022-07-23 04:29:52,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243600,243613] [2022-07-23 04:29:52,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243743,243756] [2022-07-23 04:29:52,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[243887,243900] [2022-07-23 04:29:52,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244028,244041] [2022-07-23 04:29:52,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244166,244179] [2022-07-23 04:29:52,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244324,244337] [2022-07-23 04:29:52,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244483,244496] [2022-07-23 04:29:52,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244639,244652] [2022-07-23 04:29:52,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244788,244801] [2022-07-23 04:29:52,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[244940,244953] [2022-07-23 04:29:52,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245091,245104] [2022-07-23 04:29:52,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245240,245253] [2022-07-23 04:29:52,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245392,245405] [2022-07-23 04:29:52,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245540,245553] [2022-07-23 04:29:52,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245693,245706] [2022-07-23 04:29:52,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245844,245857] [2022-07-23 04:29:52,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[245994,246007] [2022-07-23 04:29:52,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246141,246154] [2022-07-23 04:29:52,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246292,246305] [2022-07-23 04:29:52,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246443,246456] [2022-07-23 04:29:52,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246591,246604] [2022-07-23 04:29:52,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246757,246770] [2022-07-23 04:29:52,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[246926,246939] [2022-07-23 04:29:52,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247093,247106] [2022-07-23 04:29:52,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247261,247274] [2022-07-23 04:29:52,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247411,247424] [2022-07-23 04:29:52,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247558,247571] [2022-07-23 04:29:52,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247719,247732] [2022-07-23 04:29:52,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[247889,247902] [2022-07-23 04:29:52,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i[248051,248064] [2022-07-23 04:29:52,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:29:52,660 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:29:52,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52 WrapperNode [2022-07-23 04:29:52,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:29:52,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:29:52,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:29:52,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:29:52,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:52,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:52,876 INFO L137 Inliner]: procedures = 486, calls = 1092, calls flagged for inlining = 196, calls inlined = 121, statements flattened = 1951 [2022-07-23 04:29:52,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:29:52,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:29:52,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:29:52,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:29:52,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:52,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:52,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:52,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:52,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:52,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:53,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:53,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:29:53,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:29:53,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:29:53,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:29:53,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (1/1) ... [2022-07-23 04:29:53,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:29:53,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:29:53,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 04:29:53,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 04:29:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-07-23 04:29:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:29:53,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:29:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 04:29:53,130 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 04:29:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-07-23 04:29:53,130 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-07-23 04:29:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:29:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:29:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-07-23 04:29:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-07-23 04:29:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_lock [2022-07-23 04:29:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_lock [2022-07-23 04:29:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:29:53,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:29:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-07-23 04:29:53,132 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-07-23 04:29:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:29:53,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:29:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-07-23 04:29:53,132 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-07-23 04:29:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:29:53,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:29:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-07-23 04:29:53,133 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-07-23 04:29:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:29:53,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:29:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_delay [2022-07-23 04:29:53,134 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_delay [2022-07-23 04:29:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_delay [2022-07-23 04:29:53,134 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_delay [2022-07-23 04:29:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:29:53,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:29:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:29:53,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:29:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:29:53,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:29:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-07-23 04:29:53,135 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-07-23 04:29:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:29:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_write_unlock [2022-07-23 04:29:53,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_write_unlock [2022-07-23 04:29:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-23 04:29:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-23 04:29:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:29:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:29:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_lock_irq [2022-07-23 04:29:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_lock_irq [2022-07-23 04:29:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-07-23 04:29:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-07-23 04:29:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:29:53,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:29:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:29:53,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:29:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:29:53,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:29:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:29:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:29:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:29:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-23 04:29:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-23 04:29:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:29:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:29:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_torture_spinlock [2022-07-23 04:29:53,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_torture_spinlock [2022-07-23 04:29:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 04:29:53,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 04:29:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_down_write [2022-07-23 04:29:53,140 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_down_write [2022-07-23 04:29:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:29:53,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:29:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure __udelay [2022-07-23 04:29:53,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __udelay [2022-07-23 04:29:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:29:53,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:29:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_write_lock [2022-07-23 04:29:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_write_lock [2022-07-23 04:29:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:29:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_up_read [2022-07-23 04:29:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_up_read [2022-07-23 04:29:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-07-23 04:29:53,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-07-23 04:29:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_unlock [2022-07-23 04:29:53,147 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_unlock [2022-07-23 04:29:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:29:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_up_write [2022-07-23 04:29:53,147 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_up_write [2022-07-23 04:29:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:29:53,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:29:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_unlock_irq [2022-07-23 04:29:53,148 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_unlock_irq [2022-07-23 04:29:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-23 04:29:53,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-23 04:29:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:29:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-07-23 04:29:53,148 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-07-23 04:29:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:29:53,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:29:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_down_read [2022-07-23 04:29:53,149 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_down_read [2022-07-23 04:29:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_write_delay [2022-07-23 04:29:53,149 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_write_delay [2022-07-23 04:29:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-07-23 04:29:53,150 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-07-23 04:29:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:29:53,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:29:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:29:53,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:29:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:29:53,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:29:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-07-23 04:29:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-07-23 04:29:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_torture_mutex [2022-07-23 04:29:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_torture_mutex [2022-07-23 04:29:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_unlock_irq [2022-07-23 04:29:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_unlock_irq [2022-07-23 04:29:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:29:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:29:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:29:53,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:29:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:29:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:29:53,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:29:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:29:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:29:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_read_lock [2022-07-23 04:29:53,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_read_lock [2022-07-23 04:29:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-23 04:29:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-23 04:29:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:29:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:29:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-07-23 04:29:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-07-23 04:29:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_lock_irq [2022-07-23 04:29:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_lock_irq [2022-07-23 04:29:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:29:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:29:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 04:29:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 04:29:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_read_delay [2022-07-23 04:29:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_read_delay [2022-07-23 04:29:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:29:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:29:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_weight [2022-07-23 04:29:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_weight [2022-07-23 04:29:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:29:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:29:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_delay [2022-07-23 04:29:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_delay [2022-07-23 04:29:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:29:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:29:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:29:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:29:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 04:29:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 04:29:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:29:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:29:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:29:53,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-07-23 04:29:53,158 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-07-23 04:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:29:53,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure __torture_print_stats [2022-07-23 04:29:53,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __torture_print_stats [2022-07-23 04:29:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_torture_spinlock [2022-07-23 04:29:53,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_torture_spinlock [2022-07-23 04:29:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:29:53,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:29:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_unlock [2022-07-23 04:29:53,159 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_unlock [2022-07-23 04:29:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_lock [2022-07-23 04:29:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_lock [2022-07-23 04:29:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:29:53,584 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:29:53,586 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:29:53,765 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:29:54,859 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:29:54,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:29:54,879 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 04:29:54,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:29:54 BoogieIcfgContainer [2022-07-23 04:29:54,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:29:54,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:29:54,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:29:54,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:29:54,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:29:50" (1/3) ... [2022-07-23 04:29:54,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527e62fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:29:54, skipping insertion in model container [2022-07-23 04:29:54,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:29:52" (2/3) ... [2022-07-23 04:29:54,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527e62fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:29:54, skipping insertion in model container [2022-07-23 04:29:54,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:29:54" (3/3) ... [2022-07-23 04:29:54,892 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i [2022-07-23 04:29:54,906 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:29:54,906 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-07-23 04:29:54,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:29:54,997 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62104d3c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58be000d [2022-07-23 04:29:54,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-07-23 04:29:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 959 states, 646 states have (on average 1.3095975232198143) internal successors, (846), 706 states have internal predecessors, (846), 201 states have call successors, (201), 81 states have call predecessors, (201), 80 states have return successors, (193), 185 states have call predecessors, (193), 193 states have call successors, (193) [2022-07-23 04:29:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 04:29:55,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:55,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:29:55,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === 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 29 more)] === [2022-07-23 04:29:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash -192389351, now seen corresponding path program 1 times [2022-07-23 04:29:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:55,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082121142] [2022-07-23 04:29:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:55,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:29:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:55,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082121142] [2022-07-23 04:29:55,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082121142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:55,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:55,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 04:29:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688984018] [2022-07-23 04:29:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:55,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:29:55,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:55,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:29:55,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 04:29:55,587 INFO L87 Difference]: Start difference. First operand has 959 states, 646 states have (on average 1.3095975232198143) internal successors, (846), 706 states have internal predecessors, (846), 201 states have call successors, (201), 81 states have call predecessors, (201), 80 states have return successors, (193), 185 states have call predecessors, (193), 193 states have call successors, (193) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 04:29:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:55,876 INFO L93 Difference]: Finished difference Result 2259 states and 3174 transitions. [2022-07-23 04:29:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:29:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-23 04:29:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:55,897 INFO L225 Difference]: With dead ends: 2259 [2022-07-23 04:29:55,897 INFO L226 Difference]: Without dead ends: 1290 [2022-07-23 04:29:55,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 04:29:55,910 INFO L413 NwaCegarLoop]: 1628 mSDtfsCounter, 314 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:55,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 2914 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 04:29:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-07-23 04:29:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 945. [2022-07-23 04:29:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 642 states have (on average 1.2523364485981308) internal successors, (804), 695 states have internal predecessors, (804), 193 states have call successors, (193), 80 states have call predecessors, (193), 79 states have return successors, (191), 183 states have call predecessors, (191), 191 states have call successors, (191) [2022-07-23 04:29:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1188 transitions. [2022-07-23 04:29:56,023 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1188 transitions. Word has length 26 [2022-07-23 04:29:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:56,024 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1188 transitions. [2022-07-23 04:29:56,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 04:29:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1188 transitions. [2022-07-23 04:29:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 04:29:56,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:56,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:29:56,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:29:56,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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 29 more)] === [2022-07-23 04:29:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1876789480, now seen corresponding path program 1 times [2022-07-23 04:29:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:56,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054313809] [2022-07-23 04:29:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:29:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:56,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054313809] [2022-07-23 04:29:56,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054313809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:56,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:56,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:29:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276030899] [2022-07-23 04:29:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:56,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:29:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:29:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:29:56,483 INFO L87 Difference]: Start difference. First operand 945 states and 1188 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 04:29:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:59,030 INFO L93 Difference]: Finished difference Result 2964 states and 3704 transitions. [2022-07-23 04:29:59,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:29:59,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-23 04:29:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:59,043 INFO L225 Difference]: With dead ends: 2964 [2022-07-23 04:29:59,043 INFO L226 Difference]: Without dead ends: 2053 [2022-07-23 04:29:59,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-07-23 04:29:59,048 INFO L413 NwaCegarLoop]: 1736 mSDtfsCounter, 1437 mSDsluCounter, 8286 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 10022 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:59,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 10022 Invalid, 2144 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [73 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-23 04:29:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2022-07-23 04:29:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1793. [2022-07-23 04:29:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1244 states have (on average 1.2532154340836013) internal successors, (1559), 1317 states have internal predecessors, (1559), 355 states have call successors, (355), 165 states have call predecessors, (355), 163 states have return successors, (362), 337 states have call predecessors, (362), 353 states have call successors, (362) [2022-07-23 04:29:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2276 transitions. [2022-07-23 04:29:59,130 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2276 transitions. Word has length 28 [2022-07-23 04:29:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:59,131 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2276 transitions. [2022-07-23 04:29:59,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 04:29:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2276 transitions. [2022-07-23 04:29:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 04:29:59,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:59,134 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:29:59,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:29:59,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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 29 more)] === [2022-07-23 04:29:59,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1675116871, now seen corresponding path program 1 times [2022-07-23 04:29:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:59,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145285178] [2022-07-23 04:29:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:29:59,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:59,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145285178] [2022-07-23 04:29:59,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145285178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:29:59,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972091278] [2022-07-23 04:29:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:59,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:29:59,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:29:59,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:29:59,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 04:30:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:00,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-23 04:30:00,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:30:00,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,306 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 04:30:00,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-23 04:30:00,326 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 04:30:00,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:00,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:00,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 04:30:00,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:00,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:00,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:30:00,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 04:30:00,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-23 04:30:00,791 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 04:30:00,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-07-23 04:30:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:00,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:30:07,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_176) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_176 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_175) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:07,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_176) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_176 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_175) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:07,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 04:30:07,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-23 04:30:07,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-23 04:30:07,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-23 04:30:07,666 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-23 04:30:07,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 04:30:07,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972091278] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:07,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:30:07,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2022-07-23 04:30:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140796504] [2022-07-23 04:30:07,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:30:07,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-23 04:30:07,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:07,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 04:30:07,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=445, Unknown=13, NotChecked=86, Total=600 [2022-07-23 04:30:07,834 INFO L87 Difference]: Start difference. First operand 1793 states and 2276 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:12,134 INFO L93 Difference]: Finished difference Result 4142 states and 5271 transitions. [2022-07-23 04:30:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:30:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-23 04:30:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:12,145 INFO L225 Difference]: With dead ends: 4142 [2022-07-23 04:30:12,146 INFO L226 Difference]: Without dead ends: 2384 [2022-07-23 04:30:12,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=132, Invalid=855, Unknown=13, NotChecked=122, Total=1122 [2022-07-23 04:30:12,151 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 1992 mSDsluCounter, 16061 mSDsCounter, 0 mSdLazyCounter, 4020 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 17561 SdHoareTripleChecker+Invalid, 5504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 4020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:12,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 17561 Invalid, 5504 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [955 Valid, 4020 Invalid, 0 Unknown, 529 Unchecked, 3.5s Time] [2022-07-23 04:30:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-07-23 04:30:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2044. [2022-07-23 04:30:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1439 states have (on average 1.266851980542043) internal successors, (1823), 1513 states have internal predecessors, (1823), 395 states have call successors, (395), 181 states have call predecessors, (395), 179 states have return successors, (402), 375 states have call predecessors, (402), 393 states have call successors, (402) [2022-07-23 04:30:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2620 transitions. [2022-07-23 04:30:12,267 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2620 transitions. Word has length 31 [2022-07-23 04:30:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:12,267 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2620 transitions. [2022-07-23 04:30:12,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2620 transitions. [2022-07-23 04:30:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 04:30:12,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:12,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:30:12,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 04:30:12,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:12,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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 29 more)] === [2022-07-23 04:30:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash 356279481, now seen corresponding path program 1 times [2022-07-23 04:30:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:12,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873845751] [2022-07-23 04:30:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:30:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:12,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:12,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873845751] [2022-07-23 04:30:12,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873845751] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:12,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527938100] [2022-07-23 04:30:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:12,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:30:12,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:30:12,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 04:30:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:13,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-23 04:30:13,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:30:13,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 04:30:13,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:13,201 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 04:30:13,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-23 04:30:13,223 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 04:30:13,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:13,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:13,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:13,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:30:13,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 04:30:13,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-23 04:30:13,568 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 04:30:13,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-07-23 04:30:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:13,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:30:14,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-23 04:30:14,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-23 04:30:14,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_285 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_286) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_286 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_285) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:14,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_285 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_286) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_286 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_285) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:14,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 04:30:14,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-23 04:30:14,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-23 04:30:14,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-23 04:30:14,854 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-23 04:30:14,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 04:30:14,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527938100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:14,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:30:14,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2022-07-23 04:30:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805996865] [2022-07-23 04:30:14,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:30:14,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 04:30:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 04:30:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=203, Unknown=4, NotChecked=124, Total=380 [2022-07-23 04:30:14,968 INFO L87 Difference]: Start difference. First operand 2044 states and 2620 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:23,081 INFO L93 Difference]: Finished difference Result 5457 states and 7456 transitions. [2022-07-23 04:30:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:30:23,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-23 04:30:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:23,108 INFO L225 Difference]: With dead ends: 5457 [2022-07-23 04:30:23,108 INFO L226 Difference]: Without dead ends: 4237 [2022-07-23 04:30:23,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=126, Invalid=486, Unknown=4, NotChecked=196, Total=812 [2022-07-23 04:30:23,116 INFO L413 NwaCegarLoop]: 3108 mSDtfsCounter, 3018 mSDsluCounter, 22253 mSDsCounter, 0 mSdLazyCounter, 6336 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 25361 SdHoareTripleChecker+Invalid, 8148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 6336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1097 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:23,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 25361 Invalid, 8148 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [715 Valid, 6336 Invalid, 0 Unknown, 1097 Unchecked, 7.2s Time] [2022-07-23 04:30:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2022-07-23 04:30:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 2052. [2022-07-23 04:30:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1445 states have (on average 1.2664359861591696) internal successors, (1830), 1520 states have internal predecessors, (1830), 396 states have call successors, (396), 182 states have call predecessors, (396), 180 states have return successors, (403), 375 states have call predecessors, (403), 394 states have call successors, (403) [2022-07-23 04:30:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2629 transitions. [2022-07-23 04:30:23,295 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2629 transitions. Word has length 32 [2022-07-23 04:30:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:23,296 INFO L495 AbstractCegarLoop]: Abstraction has 2052 states and 2629 transitions. [2022-07-23 04:30:23,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2629 transitions. [2022-07-23 04:30:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 04:30:23,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:23,298 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:30:23,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 04:30:23,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-23 04:30:23,516 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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 29 more)] === [2022-07-23 04:30:23,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:23,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1407947960, now seen corresponding path program 2 times [2022-07-23 04:30:23,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:23,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188715888] [2022-07-23 04:30:23,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:30:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:23,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188715888] [2022-07-23 04:30:23,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188715888] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:23,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126882386] [2022-07-23 04:30:23,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 04:30:23,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:23,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:30:23,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:30:24,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 04:30:24,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 04:30:24,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 04:30:24,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-23 04:30:24,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:30:24,688 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 04:30:24,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:24,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-23 04:30:24,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:24,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 04:30:24,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:24,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:24,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:24,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:25,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:30:25,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 04:30:25,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-23 04:30:25,205 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 04:30:25,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-23 04:30:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:25,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:30:26,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-23 04:30:26,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:26,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:26,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:26,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 04:30:26,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-23 04:30:26,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-23 04:30:26,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-23 04:30:26,672 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-23 04:30:26,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 04:30:26,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126882386] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:26,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:30:26,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-23 04:30:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006496669] [2022-07-23 04:30:26,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:30:26,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 04:30:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 04:30:26,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=403, Unknown=4, NotChecked=172, Total=650 [2022-07-23 04:30:26,802 INFO L87 Difference]: Start difference. First operand 2052 states and 2629 transitions. Second operand has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:35,720 INFO L93 Difference]: Finished difference Result 5644 states and 7164 transitions. [2022-07-23 04:30:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 04:30:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-07-23 04:30:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:35,740 INFO L225 Difference]: With dead ends: 5644 [2022-07-23 04:30:35,741 INFO L226 Difference]: Without dead ends: 4438 [2022-07-23 04:30:35,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=320, Invalid=1332, Unknown=4, NotChecked=324, Total=1980 [2022-07-23 04:30:35,748 INFO L413 NwaCegarLoop]: 2551 mSDtfsCounter, 3637 mSDsluCounter, 24587 mSDsCounter, 0 mSdLazyCounter, 8762 mSolverCounterSat, 1858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3638 SdHoareTripleChecker+Valid, 27138 SdHoareTripleChecker+Invalid, 11205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1858 IncrementalHoareTripleChecker+Valid, 8762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 585 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:35,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3638 Valid, 27138 Invalid, 11205 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1858 Valid, 8762 Invalid, 0 Unknown, 585 Unchecked, 7.6s Time] [2022-07-23 04:30:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2022-07-23 04:30:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 3694. [2022-07-23 04:30:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 2602 states have (on average 1.2598001537279016) internal successors, (3278), 2725 states have internal predecessors, (3278), 725 states have call successors, (725), 344 states have call predecessors, (725), 336 states have return successors, (747), 683 states have call predecessors, (747), 723 states have call successors, (747) [2022-07-23 04:30:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4750 transitions. [2022-07-23 04:30:35,998 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 4750 transitions. Word has length 34 [2022-07-23 04:30:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:36,000 INFO L495 AbstractCegarLoop]: Abstraction has 3694 states and 4750 transitions. [2022-07-23 04:30:36,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 4750 transitions. [2022-07-23 04:30:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 04:30:36,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:36,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:30:36,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-23 04:30:36,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:36,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:30:36,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1168508767, now seen corresponding path program 1 times [2022-07-23 04:30:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:36,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143502717] [2022-07-23 04:30:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:36,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:30:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 04:30:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143502717] [2022-07-23 04:30:36,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143502717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:30:36,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:30:36,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 04:30:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766127509] [2022-07-23 04:30:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:30:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:30:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:36,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:30:36,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 04:30:36,335 INFO L87 Difference]: Start difference. First operand 3694 states and 4750 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:36,514 INFO L93 Difference]: Finished difference Result 6152 states and 7930 transitions. [2022-07-23 04:30:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:30:36,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-07-23 04:30:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:36,533 INFO L225 Difference]: With dead ends: 6152 [2022-07-23 04:30:36,533 INFO L226 Difference]: Without dead ends: 3694 [2022-07-23 04:30:36,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 04:30:36,545 INFO L413 NwaCegarLoop]: 1178 mSDtfsCounter, 1167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1178 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-07-23 04:30:36,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1178 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:30:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2022-07-23 04:30:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3694. [2022-07-23 04:30:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 2602 states have (on average 1.2548039969254419) internal successors, (3265), 2725 states have internal predecessors, (3265), 725 states have call successors, (725), 344 states have call predecessors, (725), 336 states have return successors, (747), 683 states have call predecessors, (747), 723 states have call successors, (747) [2022-07-23 04:30:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4737 transitions. [2022-07-23 04:30:36,783 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 4737 transitions. Word has length 36 [2022-07-23 04:30:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:36,783 INFO L495 AbstractCegarLoop]: Abstraction has 3694 states and 4737 transitions. [2022-07-23 04:30:36,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 4737 transitions. [2022-07-23 04:30:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 04:30:36,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:36,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-23 04:30:36,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:30:36,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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 29 more)] === [2022-07-23 04:30:36,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:36,787 INFO L85 PathProgramCache]: Analyzing trace with hash 753319847, now seen corresponding path program 3 times [2022-07-23 04:30:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:36,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840727631] [2022-07-23 04:30:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:30:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:37,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:37,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840727631] [2022-07-23 04:30:37,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840727631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:37,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124518095] [2022-07-23 04:30:37,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 04:30:37,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:37,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:30:37,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:30:37,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 04:30:38,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 04:30:38,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 04:30:38,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-23 04:30:38,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:30:38,431 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 04:30:38,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:38,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 04:30:38,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:38,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-23 04:30:38,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:38,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 04:30:38,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:38,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 04:30:38,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 04:30:38,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:38,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:30:38,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:30:39,105 INFO L356 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-07-23 04:30:39,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 19 [2022-07-23 04:30:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:39,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:30:40,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-23 04:30:40,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-23 04:30:40,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_604 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_605) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_605 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_604) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:30:40,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_604 (Array Int Int))) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_605) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_605 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_604) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:30:40,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_604 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_605) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_605 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_604) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:30:40,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_604 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_605) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_605 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_604) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:30:40,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 04:30:40,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-23 04:30:40,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 237 [2022-07-23 04:30:40,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-23 04:30:40,929 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-23 04:30:40,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 04:30:41,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124518095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:41,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:30:41,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2022-07-23 04:30:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149718517] [2022-07-23 04:30:41,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:30:41,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 04:30:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:41,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 04:30:41,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=453, Unknown=6, NotChecked=282, Total=812 [2022-07-23 04:30:41,062 INFO L87 Difference]: Start difference. First operand 3694 states and 4737 transitions. Second operand has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:52,596 INFO L93 Difference]: Finished difference Result 7368 states and 9382 transitions. [2022-07-23 04:30:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 04:30:52,596 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-23 04:30:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:52,617 INFO L225 Difference]: With dead ends: 7368 [2022-07-23 04:30:52,618 INFO L226 Difference]: Without dead ends: 4526 [2022-07-23 04:30:52,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=332, Invalid=1492, Unknown=6, NotChecked=522, Total=2352 [2022-07-23 04:30:52,628 INFO L413 NwaCegarLoop]: 2523 mSDtfsCounter, 4073 mSDsluCounter, 21250 mSDsCounter, 0 mSdLazyCounter, 10105 mSolverCounterSat, 1991 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4073 SdHoareTripleChecker+Valid, 23773 SdHoareTripleChecker+Invalid, 12649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1991 IncrementalHoareTripleChecker+Valid, 10105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 553 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:52,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4073 Valid, 23773 Invalid, 12649 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1991 Valid, 10105 Invalid, 0 Unknown, 553 Unchecked, 9.6s Time] [2022-07-23 04:30:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2022-07-23 04:30:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3701. [2022-07-23 04:30:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 2609 states have (on average 1.254503641241855) internal successors, (3273), 2732 states have internal predecessors, (3273), 725 states have call successors, (725), 344 states have call predecessors, (725), 336 states have return successors, (747), 683 states have call predecessors, (747), 723 states have call successors, (747) [2022-07-23 04:30:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 4745 transitions. [2022-07-23 04:30:52,955 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 4745 transitions. Word has length 37 [2022-07-23 04:30:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:52,955 INFO L495 AbstractCegarLoop]: Abstraction has 3701 states and 4745 transitions. [2022-07-23 04:30:52,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 4745 transitions. [2022-07-23 04:30:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 04:30:52,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:52,958 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:30:52,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 04:30:53,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:53,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 29 more)] === [2022-07-23 04:30:53,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:53,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2121270696, now seen corresponding path program 4 times [2022-07-23 04:30:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:53,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423804938] [2022-07-23 04:30:53,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:30:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:53,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423804938] [2022-07-23 04:30:53,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423804938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209592635] [2022-07-23 04:30:53,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 04:30:53,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:53,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:30:53,583 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:30:53,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 04:30:54,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 04:30:54,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 04:30:54,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 04:30:54,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:30:54,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 04:30:54,151 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 04:30:54,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:54,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:30:54,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-23 04:30:54,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:54,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:54,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:54,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:54,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:54,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:54,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:30:54,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:30:54,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 04:30:54,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:30:54,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-23 04:30:54,787 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 04:30:54,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-23 04:30:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:30:54,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:30:55,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-23 04:30:55,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_756) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_756 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_757) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:55,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_756) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_756 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_757) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:55,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_756) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_756 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_757) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:55,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_756) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_756 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_757) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:55,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_756) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_756 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_757) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:30:55,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 04:30:55,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-23 04:30:55,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-23 04:30:55,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-23 04:30:55,721 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-23 04:30:55,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 04:30:55,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209592635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:30:55,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:30:55,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-23 04:30:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009579016] [2022-07-23 04:30:55,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:30:55,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 04:30:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:55,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 04:30:55,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=530, Unknown=6, NotChecked=306, Total=930 [2022-07-23 04:30:55,859 INFO L87 Difference]: Start difference. First operand 3701 states and 4745 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:59,660 INFO L93 Difference]: Finished difference Result 6084 states and 7854 transitions. [2022-07-23 04:30:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:30:59,660 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-07-23 04:30:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:59,676 INFO L225 Difference]: With dead ends: 6084 [2022-07-23 04:30:59,676 INFO L226 Difference]: Without dead ends: 3238 [2022-07-23 04:30:59,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=1071, Unknown=6, NotChecked=438, Total=1722 [2022-07-23 04:30:59,686 INFO L413 NwaCegarLoop]: 1496 mSDtfsCounter, 2942 mSDsluCounter, 10419 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 1412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2943 SdHoareTripleChecker+Valid, 11915 SdHoareTripleChecker+Invalid, 5410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1412 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 693 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:59,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2943 Valid, 11915 Invalid, 5410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1412 Valid, 3305 Invalid, 0 Unknown, 693 Unchecked, 2.9s Time] [2022-07-23 04:30:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2022-07-23 04:30:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 2166. [2022-07-23 04:30:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1543 states have (on average 1.2650680492546986) internal successors, (1952), 1621 states have internal predecessors, (1952), 410 states have call successors, (410), 184 states have call predecessors, (410), 182 states have return successors, (417), 386 states have call predecessors, (417), 408 states have call successors, (417) [2022-07-23 04:30:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2779 transitions. [2022-07-23 04:30:59,907 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2779 transitions. Word has length 40 [2022-07-23 04:30:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:59,907 INFO L495 AbstractCegarLoop]: Abstraction has 2166 states and 2779 transitions. [2022-07-23 04:30:59,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:30:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2779 transitions. [2022-07-23 04:30:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 04:30:59,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:59,909 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:30:59,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 04:31:00,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:31:00,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 29 more)] === [2022-07-23 04:31:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:31:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1367618104, now seen corresponding path program 2 times [2022-07-23 04:31:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:31:00,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392948290] [2022-07-23 04:31:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:31:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:31:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:00,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:31:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:00,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:31:00,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392948290] [2022-07-23 04:31:00,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392948290] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:31:00,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853060393] [2022-07-23 04:31:00,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 04:31:00,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:31:00,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:31:00,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:31:00,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 04:31:00,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 04:31:00,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 04:31:00,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-23 04:31:00,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:31:00,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 04:31:00,846 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 04:31:00,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:00,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:00,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-23 04:31:00,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:00,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:01,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:01,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:01,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:01,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:01,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:01,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:01,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:31:01,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 04:31:01,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 04:31:01,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:01,404 INFO L356 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-07-23 04:31:01,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 19 [2022-07-23 04:31:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:01,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:31:05,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-23 04:31:05,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_908 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_909) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_909 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_908) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:31:05,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_908 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_909) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_909 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_908) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:31:05,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_908 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_909) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_909 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_908) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:31:05,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_908 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (not (= (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_909) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_909 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_908) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:31:05,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_908 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (not (= (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_909) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_909 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_908) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-23 04:31:05,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 04:31:05,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-23 04:31:05,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-23 04:31:05,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-23 04:31:05,928 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-23 04:31:05,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 04:31:06,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853060393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:31:06,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:31:06,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-07-23 04:31:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292229723] [2022-07-23 04:31:06,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:31:06,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 04:31:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:31:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 04:31:06,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=439, Unknown=11, NotChecked=282, Total=812 [2022-07-23 04:31:06,060 INFO L87 Difference]: Start difference. First operand 2166 states and 2779 transitions. Second operand has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:31:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:31:18,566 INFO L93 Difference]: Finished difference Result 10432 states and 14795 transitions. [2022-07-23 04:31:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 04:31:18,567 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-07-23 04:31:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:31:18,606 INFO L225 Difference]: With dead ends: 10432 [2022-07-23 04:31:18,606 INFO L226 Difference]: Without dead ends: 8643 [2022-07-23 04:31:18,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=216, Invalid=1203, Unknown=11, NotChecked=462, Total=1892 [2022-07-23 04:31:18,615 INFO L413 NwaCegarLoop]: 5598 mSDtfsCounter, 4281 mSDsluCounter, 53236 mSDsCounter, 0 mSdLazyCounter, 14375 mSolverCounterSat, 1083 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 58834 SdHoareTripleChecker+Invalid, 17355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1083 IncrementalHoareTripleChecker+Valid, 14375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1897 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:31:18,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 58834 Invalid, 17355 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1083 Valid, 14375 Invalid, 0 Unknown, 1897 Unchecked, 10.6s Time] [2022-07-23 04:31:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8643 states. [2022-07-23 04:31:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8643 to 2467. [2022-07-23 04:31:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 1775 states have (on average 1.2738028169014084) internal successors, (2261), 1856 states have internal predecessors, (2261), 459 states have call successors, (459), 204 states have call predecessors, (459), 202 states have return successors, (468), 432 states have call predecessors, (468), 457 states have call successors, (468) [2022-07-23 04:31:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3188 transitions. [2022-07-23 04:31:18,930 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3188 transitions. Word has length 41 [2022-07-23 04:31:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:31:18,931 INFO L495 AbstractCegarLoop]: Abstraction has 2467 states and 3188 transitions. [2022-07-23 04:31:18,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:31:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3188 transitions. [2022-07-23 04:31:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 04:31:18,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:31:18,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:31:18,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 04:31:19,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:31:19,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:31:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:31:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1262413276, now seen corresponding path program 1 times [2022-07-23 04:31:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:31:19,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430402846] [2022-07-23 04:31:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:31:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:31:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:19,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:31:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:31:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:19,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 04:31:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:19,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:31:19,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430402846] [2022-07-23 04:31:19,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430402846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:31:19,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:31:19,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 04:31:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858109496] [2022-07-23 04:31:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:31:19,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 04:31:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:31:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 04:31:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 04:31:19,259 INFO L87 Difference]: Start difference. First operand 2467 states and 3188 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 04:31:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:31:19,555 INFO L93 Difference]: Finished difference Result 2521 states and 3259 transitions. [2022-07-23 04:31:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 04:31:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-23 04:31:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:31:19,566 INFO L225 Difference]: With dead ends: 2521 [2022-07-23 04:31:19,566 INFO L226 Difference]: Without dead ends: 2519 [2022-07-23 04:31:19,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 04:31:19,569 INFO L413 NwaCegarLoop]: 1178 mSDtfsCounter, 33 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:31:19,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3521 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:31:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-07-23 04:31:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2477. [2022-07-23 04:31:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 1785 states have (on average 1.2722689075630251) internal successors, (2271), 1866 states have internal predecessors, (2271), 459 states have call successors, (459), 204 states have call predecessors, (459), 202 states have return successors, (468), 432 states have call predecessors, (468), 457 states have call successors, (468) [2022-07-23 04:31:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3198 transitions. [2022-07-23 04:31:19,800 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3198 transitions. Word has length 43 [2022-07-23 04:31:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:31:19,800 INFO L495 AbstractCegarLoop]: Abstraction has 2477 states and 3198 transitions. [2022-07-23 04:31:19,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 04:31:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3198 transitions. [2022-07-23 04:31:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 04:31:19,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:31:19,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:31:19,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:31:19,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:31:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:31:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1262472858, now seen corresponding path program 1 times [2022-07-23 04:31:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:31:19,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098673645] [2022-07-23 04:31:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:31:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:31:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:19,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:31:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:19,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:31:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:19,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 04:31:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:31:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098673645] [2022-07-23 04:31:19,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098673645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:31:19,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:31:19,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:31:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102393347] [2022-07-23 04:31:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:31:19,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:31:19,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:31:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:31:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:31:19,914 INFO L87 Difference]: Start difference. First operand 2477 states and 3198 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 04:31:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:31:20,648 INFO L93 Difference]: Finished difference Result 4670 states and 6114 transitions. [2022-07-23 04:31:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:31:20,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-23 04:31:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:31:20,656 INFO L225 Difference]: With dead ends: 4670 [2022-07-23 04:31:20,656 INFO L226 Difference]: Without dead ends: 2465 [2022-07-23 04:31:20,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:31:20,665 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1161 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4295 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:31:20,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4295 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:31:20,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2022-07-23 04:31:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2465. [2022-07-23 04:31:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 1774 states have (on average 1.2683201803833146) internal successors, (2250), 1854 states have internal predecessors, (2250), 459 states have call successors, (459), 204 states have call predecessors, (459), 202 states have return successors, (468), 432 states have call predecessors, (468), 457 states have call successors, (468) [2022-07-23 04:31:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3177 transitions. [2022-07-23 04:31:20,953 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3177 transitions. Word has length 43 [2022-07-23 04:31:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:31:20,953 INFO L495 AbstractCegarLoop]: Abstraction has 2465 states and 3177 transitions. [2022-07-23 04:31:20,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 04:31:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3177 transitions. [2022-07-23 04:31:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 04:31:20,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:31:20,955 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:31:20,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:31:20,955 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 29 more)] === [2022-07-23 04:31:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:31:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1695222265, now seen corresponding path program 5 times [2022-07-23 04:31:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:31:20,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835380454] [2022-07-23 04:31:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:31:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:31:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:31:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:21,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:31:21,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835380454] [2022-07-23 04:31:21,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835380454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:31:21,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372117136] [2022-07-23 04:31:21,495 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 04:31:21,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:31:21,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:31:21,504 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:31:21,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 04:31:21,986 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-23 04:31:21,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 04:31:21,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-23 04:31:21,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:31:22,091 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 04:31:22,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:22,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-23 04:31:22,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:22,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 04:31:22,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:22,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:22,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:22,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:22,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:22,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:22,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:22,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:22,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:22,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:22,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:31:22,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 04:31:22,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-23 04:31:22,821 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 04:31:22,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-07-23 04:31:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:22,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:31:23,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-23 04:31:25,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1187) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1187 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1186) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:25,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1187) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1187 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1186) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-23 04:31:25,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1187) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1187 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1186) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:25,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1187) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1187 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1186) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:25,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1187) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1187 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1186) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:25,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1187) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1187 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1186) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:25,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 04:31:25,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-23 04:31:25,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-23 04:31:25,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-23 04:31:25,747 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-23 04:31:25,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 04:31:25,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372117136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:31:25,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:31:25,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-07-23 04:31:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706262825] [2022-07-23 04:31:25,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:31:25,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 04:31:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:31:25,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 04:31:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=746, Unknown=9, NotChecked=420, Total=1260 [2022-07-23 04:31:25,879 INFO L87 Difference]: Start difference. First operand 2465 states and 3177 transitions. Second operand has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:31:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:31:36,719 INFO L93 Difference]: Finished difference Result 6281 states and 8090 transitions. [2022-07-23 04:31:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 04:31:36,720 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-07-23 04:31:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:31:36,732 INFO L225 Difference]: With dead ends: 6281 [2022-07-23 04:31:36,733 INFO L226 Difference]: Without dead ends: 4577 [2022-07-23 04:31:36,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=381, Invalid=2394, Unknown=9, NotChecked=756, Total=3540 [2022-07-23 04:31:36,739 INFO L413 NwaCegarLoop]: 2659 mSDtfsCounter, 4466 mSDsluCounter, 26310 mSDsCounter, 0 mSdLazyCounter, 10386 mSolverCounterSat, 2191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4466 SdHoareTripleChecker+Valid, 28969 SdHoareTripleChecker+Invalid, 13938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2191 IncrementalHoareTripleChecker+Valid, 10386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1361 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:31:36,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4466 Valid, 28969 Invalid, 13938 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2191 Valid, 10386 Invalid, 0 Unknown, 1361 Unchecked, 8.5s Time] [2022-07-23 04:31:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4577 states. [2022-07-23 04:31:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4577 to 3527. [2022-07-23 04:31:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 2517 states have (on average 1.257052046086611) internal successors, (3164), 2628 states have internal predecessors, (3164), 670 states have call successors, (670), 316 states have call predecessors, (670), 310 states have return successors, (691), 629 states have call predecessors, (691), 668 states have call successors, (691) [2022-07-23 04:31:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 4525 transitions. [2022-07-23 04:31:37,234 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 4525 transitions. Word has length 43 [2022-07-23 04:31:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:31:37,234 INFO L495 AbstractCegarLoop]: Abstraction has 3527 states and 4525 transitions. [2022-07-23 04:31:37,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:31:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 4525 transitions. [2022-07-23 04:31:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-23 04:31:37,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:31:37,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:31:37,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 04:31:37,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:31:37,463 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:31:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:31:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash -460727510, now seen corresponding path program 1 times [2022-07-23 04:31:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:31:37,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501063791] [2022-07-23 04:31:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:31:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:31:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:31:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:31:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:37,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 04:31:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:31:37,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501063791] [2022-07-23 04:31:37,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501063791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:31:37,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:31:37,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 04:31:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140709700] [2022-07-23 04:31:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:31:37,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:31:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:31:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:31:37,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 04:31:37,580 INFO L87 Difference]: Start difference. First operand 3527 states and 4525 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 04:31:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:31:37,995 INFO L93 Difference]: Finished difference Result 6582 states and 8551 transitions. [2022-07-23 04:31:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:31:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2022-07-23 04:31:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:31:38,009 INFO L225 Difference]: With dead ends: 6582 [2022-07-23 04:31:38,010 INFO L226 Difference]: Without dead ends: 3511 [2022-07-23 04:31:38,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 04:31:38,021 INFO L413 NwaCegarLoop]: 1171 mSDtfsCounter, 1140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:31:38,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1171 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:31:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2022-07-23 04:31:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3511. [2022-07-23 04:31:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 2502 states have (on average 1.2529976019184652) internal successors, (3135), 2612 states have internal predecessors, (3135), 670 states have call successors, (670), 316 states have call predecessors, (670), 310 states have return successors, (691), 629 states have call predecessors, (691), 668 states have call successors, (691) [2022-07-23 04:31:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 4496 transitions. [2022-07-23 04:31:38,487 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 4496 transitions. Word has length 47 [2022-07-23 04:31:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:31:38,488 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 4496 transitions. [2022-07-23 04:31:38,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 04:31:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 4496 transitions. [2022-07-23 04:31:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 04:31:38,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:31:38,490 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:31:38,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:31:38,490 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 29 more)] === [2022-07-23 04:31:38,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:31:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash -914774024, now seen corresponding path program 6 times [2022-07-23 04:31:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:31:38,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313646905] [2022-07-23 04:31:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:31:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:31:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:31:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:39,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:31:39,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313646905] [2022-07-23 04:31:39,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313646905] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:31:39,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713711383] [2022-07-23 04:31:39,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 04:31:39,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:31:39,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:31:39,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:31:39,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 04:31:40,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-23 04:31:40,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 04:31:40,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-23 04:31:40,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:31:40,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,845 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 04:31:40,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-23 04:31:40,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 04:31:40,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-23 04:31:40,884 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 04:31:40,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:40,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:40,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:41,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:41,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:41,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:41,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:41,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:41,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:41,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:41,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:41,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 04:31:41,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-23 04:31:41,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 04:31:41,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 04:31:41,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-23 04:31:41,532 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 04:31:41,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-07-23 04:31:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:41,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:31:42,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-23 04:31:43,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1422 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1423) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1423 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1422) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:43,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1422 (Array Int Int))) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1423) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1423 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1422) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-23 04:31:43,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1422 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1423) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1423 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1422) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:43,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1422 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1423) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1423 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1422) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:43,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1422 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1423) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1423 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1422) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:43,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1422 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 48 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1423) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1423 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1422) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:43,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1422 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 48))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1423) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1423 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1422) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-23 04:31:43,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 04:31:43,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-23 04:31:43,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2022-07-23 04:31:43,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 226 [2022-07-23 04:31:43,311 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-23 04:31:43,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-23 04:31:43,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713711383] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:31:43,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:31:43,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2022-07-23 04:31:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628603592] [2022-07-23 04:31:43,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:31:43,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 04:31:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:31:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 04:31:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=726, Unknown=9, NotChecked=488, Total=1332 [2022-07-23 04:31:43,441 INFO L87 Difference]: Start difference. First operand 3511 states and 4496 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:31:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:31:51,211 INFO L93 Difference]: Finished difference Result 6865 states and 8978 transitions. [2022-07-23 04:31:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 04:31:51,212 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-23 04:31:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:31:51,232 INFO L225 Difference]: With dead ends: 6865 [2022-07-23 04:31:51,232 INFO L226 Difference]: Without dead ends: 4061 [2022-07-23 04:31:51,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=215, Invalid=1290, Unknown=9, NotChecked=648, Total=2162 [2022-07-23 04:31:51,242 INFO L413 NwaCegarLoop]: 1701 mSDtfsCounter, 2679 mSDsluCounter, 18411 mSDsCounter, 0 mSdLazyCounter, 8503 mSolverCounterSat, 1318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 20112 SdHoareTripleChecker+Invalid, 9843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1318 IncrementalHoareTripleChecker+Valid, 8503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:31:51,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 20112 Invalid, 9843 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1318 Valid, 8503 Invalid, 0 Unknown, 22 Unchecked, 6.5s Time] [2022-07-23 04:31:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2022-07-23 04:31:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 2451. [2022-07-23 04:31:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 1763 states have (on average 1.266023823028928) internal successors, (2232), 1841 states have internal predecessors, (2232), 458 states have call successors, (458), 203 states have call predecessors, (458), 201 states have return successors, (467), 432 states have call predecessors, (467), 456 states have call successors, (467) [2022-07-23 04:31:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3157 transitions. [2022-07-23 04:31:51,694 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3157 transitions. Word has length 46 [2022-07-23 04:31:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:31:51,694 INFO L495 AbstractCegarLoop]: Abstraction has 2451 states and 3157 transitions. [2022-07-23 04:31:51,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 04:31:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3157 transitions. [2022-07-23 04:31:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-23 04:31:51,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:31:51,697 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:31:51,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 04:31:51,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-23 04:31:51,907 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 29 more)] === [2022-07-23 04:31:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:31:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1674040360, now seen corresponding path program 3 times [2022-07-23 04:31:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:31:51,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784546573] [2022-07-23 04:31:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:31:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:31:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:31:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:31:52,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784546573] [2022-07-23 04:31:52,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784546573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:31:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596273261] [2022-07-23 04:31:52,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 04:31:52,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:31:52,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:31:52,096 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:31:52,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 04:31:53,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-23 04:31:53,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 04:31:53,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 1459 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 04:31:53,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:31:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:53,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:31:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 04:31:53,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596273261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:31:53,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:31:53,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-07-23 04:31:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420738270] [2022-07-23 04:31:53,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:31:53,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:31:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:31:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:31:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:31:53,489 INFO L87 Difference]: Start difference. First operand 2451 states and 3157 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 04:31:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:31:58,643 INFO L93 Difference]: Finished difference Result 9374 states and 13385 transitions. [2022-07-23 04:31:58,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:31:58,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-07-23 04:31:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:31:58,669 INFO L225 Difference]: With dead ends: 9374 [2022-07-23 04:31:58,670 INFO L226 Difference]: Without dead ends: 7590 [2022-07-23 04:31:58,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:31:58,678 INFO L413 NwaCegarLoop]: 5103 mSDtfsCounter, 2396 mSDsluCounter, 31281 mSDsCounter, 0 mSdLazyCounter, 7333 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3266 SdHoareTripleChecker+Valid, 36384 SdHoareTripleChecker+Invalid, 7386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 7333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:31:58,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3266 Valid, 36384 Invalid, 7386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 7333 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-23 04:31:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7590 states. [2022-07-23 04:31:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7590 to 2346. [2022-07-23 04:31:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 1693 states have (on average 1.262256349675133) internal successors, (2137), 1761 states have internal predecessors, (2137), 438 states have call successors, (438), 190 states have call predecessors, (438), 187 states have return successors, (445), 419 states have call predecessors, (445), 436 states have call successors, (445) [2022-07-23 04:31:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3020 transitions. [2022-07-23 04:31:59,138 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3020 transitions. Word has length 47 [2022-07-23 04:31:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:31:59,139 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 3020 transitions. [2022-07-23 04:31:59,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 04:31:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3020 transitions. [2022-07-23 04:31:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 04:31:59,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:31:59,140 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:31:59,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 04:31:59,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-23 04:31:59,356 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 29 more)] === [2022-07-23 04:31:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:31:59,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2094288900, now seen corresponding path program 1 times [2022-07-23 04:31:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:31:59,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613346654] [2022-07-23 04:31:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:31:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:31:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:31:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:31:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:31:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:31:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:59,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:31:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:31:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:31:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:31:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:31:59,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:31:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613346654] [2022-07-23 04:31:59,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613346654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:31:59,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:31:59,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 04:31:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979745369] [2022-07-23 04:31:59,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:31:59,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 04:31:59,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:31:59,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 04:31:59,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 04:31:59,479 INFO L87 Difference]: Start difference. First operand 2346 states and 3020 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 04:32:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:01,414 INFO L93 Difference]: Finished difference Result 4016 states and 5198 transitions. [2022-07-23 04:32:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:32:01,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-07-23 04:32:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:01,425 INFO L225 Difference]: With dead ends: 4016 [2022-07-23 04:32:01,425 INFO L226 Difference]: Without dead ends: 2772 [2022-07-23 04:32:01,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:01,432 INFO L413 NwaCegarLoop]: 1453 mSDtfsCounter, 1207 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:01,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2903 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-23 04:32:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2022-07-23 04:32:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2347. [2022-07-23 04:32:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1694 states have (on average 1.2621015348288076) internal successors, (2138), 1762 states have internal predecessors, (2138), 438 states have call successors, (438), 190 states have call predecessors, (438), 187 states have return successors, (445), 419 states have call predecessors, (445), 436 states have call successors, (445) [2022-07-23 04:32:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3021 transitions. [2022-07-23 04:32:01,857 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3021 transitions. Word has length 52 [2022-07-23 04:32:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:01,858 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3021 transitions. [2022-07-23 04:32:01,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 04:32:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3021 transitions. [2022-07-23 04:32:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 04:32:01,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:01,859 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:01,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:32:01,860 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 29 more)] === [2022-07-23 04:32:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1952531902, now seen corresponding path program 1 times [2022-07-23 04:32:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:01,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542414783] [2022-07-23 04:32:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:01,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:01,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:01,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:01,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542414783] [2022-07-23 04:32:01,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542414783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:01,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:01,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611382755] [2022-07-23 04:32:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:01,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:01,972 INFO L87 Difference]: Start difference. First operand 2347 states and 3021 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 04:32:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:03,442 INFO L93 Difference]: Finished difference Result 2347 states and 3021 transitions. [2022-07-23 04:32:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:03,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-07-23 04:32:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:03,448 INFO L225 Difference]: With dead ends: 2347 [2022-07-23 04:32:03,449 INFO L226 Difference]: Without dead ends: 2345 [2022-07-23 04:32:03,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:03,450 INFO L413 NwaCegarLoop]: 1063 mSDtfsCounter, 1755 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:03,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 2149 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2022-07-23 04:32:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2345. [2022-07-23 04:32:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1693 states have (on average 1.2616656822209096) internal successors, (2136), 1760 states have internal predecessors, (2136), 438 states have call successors, (438), 190 states have call predecessors, (438), 187 states have return successors, (445), 419 states have call predecessors, (445), 436 states have call successors, (445) [2022-07-23 04:32:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3019 transitions. [2022-07-23 04:32:03,885 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3019 transitions. Word has length 52 [2022-07-23 04:32:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:03,886 INFO L495 AbstractCegarLoop]: Abstraction has 2345 states and 3019 transitions. [2022-07-23 04:32:03,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 04:32:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3019 transitions. [2022-07-23 04:32:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 04:32:03,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:03,888 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:03,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:32:03,888 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 29 more)] === [2022-07-23 04:32:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 805801132, now seen corresponding path program 1 times [2022-07-23 04:32:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:03,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065371311] [2022-07-23 04:32:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:04,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:04,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065371311] [2022-07-23 04:32:04,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065371311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:04,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:04,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124894991] [2022-07-23 04:32:04,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:04,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:04,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:04,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:04,031 INFO L87 Difference]: Start difference. First operand 2345 states and 3019 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-23 04:32:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:05,520 INFO L93 Difference]: Finished difference Result 2345 states and 3019 transitions. [2022-07-23 04:32:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:05,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2022-07-23 04:32:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:05,525 INFO L225 Difference]: With dead ends: 2345 [2022-07-23 04:32:05,526 INFO L226 Difference]: Without dead ends: 2343 [2022-07-23 04:32:05,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:05,527 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 1749 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:05,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 2147 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-07-23 04:32:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-07-23 04:32:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1692 states have (on average 1.2612293144208038) internal successors, (2134), 1758 states have internal predecessors, (2134), 438 states have call successors, (438), 190 states have call predecessors, (438), 187 states have return successors, (445), 419 states have call predecessors, (445), 436 states have call successors, (445) [2022-07-23 04:32:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3017 transitions. [2022-07-23 04:32:05,894 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3017 transitions. Word has length 58 [2022-07-23 04:32:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:05,894 INFO L495 AbstractCegarLoop]: Abstraction has 2343 states and 3017 transitions. [2022-07-23 04:32:05,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-23 04:32:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3017 transitions. [2022-07-23 04:32:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 04:32:05,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:05,896 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:05,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:32:05,897 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 29 more)] === [2022-07-23 04:32:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1631090702, now seen corresponding path program 1 times [2022-07-23 04:32:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:05,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686477054] [2022-07-23 04:32:05,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:05,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:05,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:05,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:05,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:06,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:06,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:06,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686477054] [2022-07-23 04:32:06,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686477054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:06,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:06,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578999362] [2022-07-23 04:32:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:06,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:06,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:06,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:06,044 INFO L87 Difference]: Start difference. First operand 2343 states and 3017 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:32:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:07,494 INFO L93 Difference]: Finished difference Result 2343 states and 3017 transitions. [2022-07-23 04:32:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:07,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-23 04:32:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:07,499 INFO L225 Difference]: With dead ends: 2343 [2022-07-23 04:32:07,499 INFO L226 Difference]: Without dead ends: 2341 [2022-07-23 04:32:07,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:07,500 INFO L413 NwaCegarLoop]: 1059 mSDtfsCounter, 1743 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:07,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 2145 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:32:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2022-07-23 04:32:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2341. [2022-07-23 04:32:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2341 states, 1691 states have (on average 1.2607924305144884) internal successors, (2132), 1756 states have internal predecessors, (2132), 438 states have call successors, (438), 190 states have call predecessors, (438), 187 states have return successors, (445), 419 states have call predecessors, (445), 436 states have call successors, (445) [2022-07-23 04:32:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3015 transitions. [2022-07-23 04:32:07,842 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3015 transitions. Word has length 64 [2022-07-23 04:32:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:07,843 INFO L495 AbstractCegarLoop]: Abstraction has 2341 states and 3015 transitions. [2022-07-23 04:32:07,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:32:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3015 transitions. [2022-07-23 04:32:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 04:32:07,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:07,845 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:07,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:32:07,846 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 29 more)] === [2022-07-23 04:32:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash 118265499, now seen corresponding path program 1 times [2022-07-23 04:32:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:07,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736313428] [2022-07-23 04:32:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:07,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:07,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:08,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736313428] [2022-07-23 04:32:08,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736313428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:08,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:08,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016053112] [2022-07-23 04:32:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:08,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:08,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:08,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:08,017 INFO L87 Difference]: Start difference. First operand 2341 states and 3015 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 04:32:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:09,583 INFO L93 Difference]: Finished difference Result 2341 states and 3015 transitions. [2022-07-23 04:32:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:09,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-23 04:32:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:09,590 INFO L225 Difference]: With dead ends: 2341 [2022-07-23 04:32:09,591 INFO L226 Difference]: Without dead ends: 2339 [2022-07-23 04:32:09,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:09,592 INFO L413 NwaCegarLoop]: 1057 mSDtfsCounter, 1737 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:09,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 2143 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2022-07-23 04:32:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2339. [2022-07-23 04:32:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 1690 states have (on average 1.2603550295857988) internal successors, (2130), 1754 states have internal predecessors, (2130), 438 states have call successors, (438), 190 states have call predecessors, (438), 187 states have return successors, (445), 419 states have call predecessors, (445), 436 states have call successors, (445) [2022-07-23 04:32:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3013 transitions. [2022-07-23 04:32:09,925 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3013 transitions. Word has length 70 [2022-07-23 04:32:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:09,925 INFO L495 AbstractCegarLoop]: Abstraction has 2339 states and 3013 transitions. [2022-07-23 04:32:09,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-23 04:32:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3013 transitions. [2022-07-23 04:32:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 04:32:09,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:09,928 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:09,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:32:09,928 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 29 more)] === [2022-07-23 04:32:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash -165422493, now seen corresponding path program 1 times [2022-07-23 04:32:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:09,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365498757] [2022-07-23 04:32:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:10,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365498757] [2022-07-23 04:32:10,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365498757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:10,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:10,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:10,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29028141] [2022-07-23 04:32:10,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:10,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:10,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:10,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:10,066 INFO L87 Difference]: Start difference. First operand 2339 states and 3013 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 04:32:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:11,661 INFO L93 Difference]: Finished difference Result 2339 states and 3013 transitions. [2022-07-23 04:32:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-23 04:32:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:11,666 INFO L225 Difference]: With dead ends: 2339 [2022-07-23 04:32:11,666 INFO L226 Difference]: Without dead ends: 2337 [2022-07-23 04:32:11,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:11,667 INFO L413 NwaCegarLoop]: 1055 mSDtfsCounter, 1731 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:11,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 2141 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2022-07-23 04:32:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2337. [2022-07-23 04:32:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 1689 states have (on average 1.2599171107164002) internal successors, (2128), 1752 states have internal predecessors, (2128), 438 states have call successors, (438), 190 states have call predecessors, (438), 187 states have return successors, (445), 419 states have call predecessors, (445), 436 states have call successors, (445) [2022-07-23 04:32:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3011 transitions. [2022-07-23 04:32:12,015 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3011 transitions. Word has length 76 [2022-07-23 04:32:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:12,015 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 3011 transitions. [2022-07-23 04:32:12,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 04:32:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3011 transitions. [2022-07-23 04:32:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 04:32:12,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:12,017 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:12,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 04:32:12,018 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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 29 more)] === [2022-07-23 04:32:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1149333130, now seen corresponding path program 1 times [2022-07-23 04:32:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:12,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655716483] [2022-07-23 04:32:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:12,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655716483] [2022-07-23 04:32:12,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655716483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:12,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:12,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:12,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985367626] [2022-07-23 04:32:12,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:12,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:12,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:12,168 INFO L87 Difference]: Start difference. First operand 2337 states and 3011 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:32:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:13,750 INFO L93 Difference]: Finished difference Result 2337 states and 3011 transitions. [2022-07-23 04:32:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:13,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-23 04:32:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:13,754 INFO L225 Difference]: With dead ends: 2337 [2022-07-23 04:32:13,754 INFO L226 Difference]: Without dead ends: 2335 [2022-07-23 04:32:13,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:13,755 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 1725 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1825 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:13,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1825 Valid, 2139 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2022-07-23 04:32:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2335. [2022-07-23 04:32:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 1688 states have (on average 1.259478672985782) internal successors, (2126), 1750 states have internal predecessors, (2126), 438 states have call successors, (438), 190 states have call predecessors, (438), 187 states have return successors, (445), 419 states have call predecessors, (445), 436 states have call successors, (445) [2022-07-23 04:32:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3009 transitions. [2022-07-23 04:32:14,065 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3009 transitions. Word has length 82 [2022-07-23 04:32:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:14,065 INFO L495 AbstractCegarLoop]: Abstraction has 2335 states and 3009 transitions. [2022-07-23 04:32:14,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 04:32:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3009 transitions. [2022-07-23 04:32:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-23 04:32:14,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:14,068 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:14,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:32:14,069 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:32:14,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash 895902082, now seen corresponding path program 1 times [2022-07-23 04:32:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:14,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573566308] [2022-07-23 04:32:14,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:32:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:32:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:32:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:32:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:32:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-23 04:32:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:14,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573566308] [2022-07-23 04:32:14,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573566308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:32:14,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399327497] [2022-07-23 04:32:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:14,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:32:14,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:32:14,373 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:32:14,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 04:32:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:14,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 04:32:14,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:32:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-23 04:32:15,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:32:15,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399327497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:15,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:32:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 25 [2022-07-23 04:32:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81085566] [2022-07-23 04:32:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:15,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 04:32:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 04:32:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-07-23 04:32:15,019 INFO L87 Difference]: Start difference. First operand 2335 states and 3009 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-23 04:32:15,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:15,804 INFO L93 Difference]: Finished difference Result 3558 states and 4528 transitions. [2022-07-23 04:32:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:32:15,805 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 86 [2022-07-23 04:32:15,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:15,811 INFO L225 Difference]: With dead ends: 3558 [2022-07-23 04:32:15,811 INFO L226 Difference]: Without dead ends: 2371 [2022-07-23 04:32:15,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 04:32:15,815 INFO L413 NwaCegarLoop]: 1127 mSDtfsCounter, 44 mSDsluCounter, 13314 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 14441 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:15,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 14441 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 04:32:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2022-07-23 04:32:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2347. [2022-07-23 04:32:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1696 states have (on average 1.258254716981132) internal successors, (2134), 1758 states have internal predecessors, (2134), 442 states have call successors, (442), 190 states have call predecessors, (442), 187 states have return successors, (449), 423 states have call predecessors, (449), 440 states have call successors, (449) [2022-07-23 04:32:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3025 transitions. [2022-07-23 04:32:16,141 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3025 transitions. Word has length 86 [2022-07-23 04:32:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:16,141 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3025 transitions. [2022-07-23 04:32:16,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-23 04:32:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3025 transitions. [2022-07-23 04:32:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 04:32:16,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:16,144 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:16,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 04:32:16,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-23 04:32:16,372 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 29 more)] === [2022-07-23 04:32:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1848628283, now seen corresponding path program 1 times [2022-07-23 04:32:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:16,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457156953] [2022-07-23 04:32:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:16,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457156953] [2022-07-23 04:32:16,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457156953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:16,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:16,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925108771] [2022-07-23 04:32:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:16,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:16,549 INFO L87 Difference]: Start difference. First operand 2347 states and 3025 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:32:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:18,034 INFO L93 Difference]: Finished difference Result 2347 states and 3025 transitions. [2022-07-23 04:32:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:18,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-23 04:32:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:18,039 INFO L225 Difference]: With dead ends: 2347 [2022-07-23 04:32:18,039 INFO L226 Difference]: Without dead ends: 2345 [2022-07-23 04:32:18,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:18,041 INFO L413 NwaCegarLoop]: 1051 mSDtfsCounter, 1719 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:18,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 2137 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2022-07-23 04:32:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2345. [2022-07-23 04:32:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1695 states have (on average 1.2578171091445427) internal successors, (2132), 1756 states have internal predecessors, (2132), 442 states have call successors, (442), 190 states have call predecessors, (442), 187 states have return successors, (449), 423 states have call predecessors, (449), 440 states have call successors, (449) [2022-07-23 04:32:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3023 transitions. [2022-07-23 04:32:18,479 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3023 transitions. Word has length 88 [2022-07-23 04:32:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:18,479 INFO L495 AbstractCegarLoop]: Abstraction has 2345 states and 3023 transitions. [2022-07-23 04:32:18,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:32:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3023 transitions. [2022-07-23 04:32:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 04:32:18,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:18,482 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:32:18,482 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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 29 more)] === [2022-07-23 04:32:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1498588316, now seen corresponding path program 1 times [2022-07-23 04:32:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:18,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105822131] [2022-07-23 04:32:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:18,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105822131] [2022-07-23 04:32:18,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105822131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:18,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:18,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725270976] [2022-07-23 04:32:18,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:18,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:18,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:18,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:18,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:18,650 INFO L87 Difference]: Start difference. First operand 2345 states and 3023 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:32:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:20,909 INFO L93 Difference]: Finished difference Result 3030 states and 3843 transitions. [2022-07-23 04:32:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:32:20,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-23 04:32:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:20,918 INFO L225 Difference]: With dead ends: 3030 [2022-07-23 04:32:20,918 INFO L226 Difference]: Without dead ends: 3028 [2022-07-23 04:32:20,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:32:20,920 INFO L413 NwaCegarLoop]: 1451 mSDtfsCounter, 2247 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:20,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2339 Valid, 3266 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-23 04:32:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2022-07-23 04:32:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2970. [2022-07-23 04:32:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2970 states, 2130 states have (on average 1.248356807511737) internal successors, (2659), 2205 states have internal predecessors, (2659), 565 states have call successors, (565), 257 states have call predecessors, (565), 254 states have return successors, (572), 545 states have call predecessors, (572), 563 states have call successors, (572) [2022-07-23 04:32:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 3796 transitions. [2022-07-23 04:32:21,413 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 3796 transitions. Word has length 94 [2022-07-23 04:32:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:21,413 INFO L495 AbstractCegarLoop]: Abstraction has 2970 states and 3796 transitions. [2022-07-23 04:32:21,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:32:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 3796 transitions. [2022-07-23 04:32:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-23 04:32:21,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:21,417 INFO L195 NwaCegarLoop]: trace histogram [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-07-23 04:32:21,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 04:32:21,417 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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 29 more)] === [2022-07-23 04:32:21,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1329188281, now seen corresponding path program 1 times [2022-07-23 04:32:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:21,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463782651] [2022-07-23 04:32:21,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:21,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:21,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463782651] [2022-07-23 04:32:21,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463782651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:21,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:21,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763309737] [2022-07-23 04:32:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:21,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:21,569 INFO L87 Difference]: Start difference. First operand 2970 states and 3796 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:32:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:23,941 INFO L93 Difference]: Finished difference Result 4701 states and 5962 transitions. [2022-07-23 04:32:23,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:32:23,943 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, (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 96 [2022-07-23 04:32:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:23,956 INFO L225 Difference]: With dead ends: 4701 [2022-07-23 04:32:23,957 INFO L226 Difference]: Without dead ends: 4699 [2022-07-23 04:32:23,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:32:23,960 INFO L413 NwaCegarLoop]: 1448 mSDtfsCounter, 2236 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:23,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 3263 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-23 04:32:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2022-07-23 04:32:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4440. [2022-07-23 04:32:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 3172 states have (on average 1.2405422446406054) internal successors, (3935), 3290 states have internal predecessors, (3935), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 5653 transitions. [2022-07-23 04:32:24,546 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 5653 transitions. Word has length 96 [2022-07-23 04:32:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:24,546 INFO L495 AbstractCegarLoop]: Abstraction has 4440 states and 5653 transitions. [2022-07-23 04:32:24,546 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:32:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 5653 transitions. [2022-07-23 04:32:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-23 04:32:24,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:24,549 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:24,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 04:32:24,549 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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 29 more)] === [2022-07-23 04:32:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2118241140, now seen corresponding path program 1 times [2022-07-23 04:32:24,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:24,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909022219] [2022-07-23 04:32:24,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:24,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:24,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:24,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909022219] [2022-07-23 04:32:24,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909022219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:24,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:24,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39186734] [2022-07-23 04:32:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:24,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:24,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:24,731 INFO L87 Difference]: Start difference. First operand 4440 states and 5653 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, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:32:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:26,306 INFO L93 Difference]: Finished difference Result 4440 states and 5653 transitions. [2022-07-23 04:32:26,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:26,307 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, (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 102 [2022-07-23 04:32:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:26,316 INFO L225 Difference]: With dead ends: 4440 [2022-07-23 04:32:26,316 INFO L226 Difference]: Without dead ends: 4438 [2022-07-23 04:32:26,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:26,318 INFO L413 NwaCegarLoop]: 1049 mSDtfsCounter, 1713 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:26,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 2135 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:32:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2022-07-23 04:32:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 4438. [2022-07-23 04:32:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 3171 states have (on average 1.23998738568275) internal successors, (3932), 3288 states have internal predecessors, (3932), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5650 transitions. [2022-07-23 04:32:26,834 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5650 transitions. Word has length 102 [2022-07-23 04:32:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:26,834 INFO L495 AbstractCegarLoop]: Abstraction has 4438 states and 5650 transitions. [2022-07-23 04:32:26,834 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, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:32:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5650 transitions. [2022-07-23 04:32:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 04:32:26,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:26,838 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:26,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 04:32:26,838 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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 29 more)] === [2022-07-23 04:32:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash 21089035, now seen corresponding path program 1 times [2022-07-23 04:32:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:26,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819415530] [2022-07-23 04:32:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:26,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819415530] [2022-07-23 04:32:26,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819415530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:26,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:26,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701729145] [2022-07-23 04:32:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:26,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:26,978 INFO L87 Difference]: Start difference. First operand 4438 states and 5650 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:32:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:28,519 INFO L93 Difference]: Finished difference Result 4438 states and 5650 transitions. [2022-07-23 04:32:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:28,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-23 04:32:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:28,529 INFO L225 Difference]: With dead ends: 4438 [2022-07-23 04:32:28,530 INFO L226 Difference]: Without dead ends: 4436 [2022-07-23 04:32:28,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:28,531 INFO L413 NwaCegarLoop]: 1047 mSDtfsCounter, 1707 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:28,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 2133 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:32:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2022-07-23 04:32:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 4436. [2022-07-23 04:32:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 3170 states have (on average 1.2394321766561514) internal successors, (3929), 3286 states have internal predecessors, (3929), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 5647 transitions. [2022-07-23 04:32:29,132 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 5647 transitions. Word has length 108 [2022-07-23 04:32:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:29,132 INFO L495 AbstractCegarLoop]: Abstraction has 4436 states and 5647 transitions. [2022-07-23 04:32:29,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:32:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 5647 transitions. [2022-07-23 04:32:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 04:32:29,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:29,136 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:29,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 04:32:29,136 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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 29 more)] === [2022-07-23 04:32:29,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash -296450308, now seen corresponding path program 1 times [2022-07-23 04:32:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:29,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793028103] [2022-07-23 04:32:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:29,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:29,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793028103] [2022-07-23 04:32:29,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793028103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:29,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:29,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:29,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486686981] [2022-07-23 04:32:29,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:29,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:29,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:29,346 INFO L87 Difference]: Start difference. First operand 4436 states and 5647 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:32:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:30,986 INFO L93 Difference]: Finished difference Result 4436 states and 5647 transitions. [2022-07-23 04:32:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-23 04:32:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:30,998 INFO L225 Difference]: With dead ends: 4436 [2022-07-23 04:32:30,998 INFO L226 Difference]: Without dead ends: 4434 [2022-07-23 04:32:31,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:31,002 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 1701 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:31,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 2131 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:32:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2022-07-23 04:32:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 4434. [2022-07-23 04:32:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4434 states, 3169 states have (on average 1.23887661722941) internal successors, (3926), 3284 states have internal predecessors, (3926), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 5644 transitions. [2022-07-23 04:32:31,654 INFO L78 Accepts]: Start accepts. Automaton has 4434 states and 5644 transitions. Word has length 114 [2022-07-23 04:32:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:31,654 INFO L495 AbstractCegarLoop]: Abstraction has 4434 states and 5644 transitions. [2022-07-23 04:32:31,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:32:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4434 states and 5644 transitions. [2022-07-23 04:32:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:32:31,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:31,659 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:32:31,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-23 04:32:31,659 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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 29 more)] === [2022-07-23 04:32:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:31,660 INFO L85 PathProgramCache]: Analyzing trace with hash -358517523, now seen corresponding path program 1 times [2022-07-23 04:32:31,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:31,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981223440] [2022-07-23 04:32:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:31,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981223440] [2022-07-23 04:32:31,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981223440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:31,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:31,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840967061] [2022-07-23 04:32:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:31,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:31,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:31,823 INFO L87 Difference]: Start difference. First operand 4434 states and 5644 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:32:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:33,316 INFO L93 Difference]: Finished difference Result 4434 states and 5644 transitions. [2022-07-23 04:32:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-23 04:32:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:33,327 INFO L225 Difference]: With dead ends: 4434 [2022-07-23 04:32:33,328 INFO L226 Difference]: Without dead ends: 4432 [2022-07-23 04:32:33,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:33,330 INFO L413 NwaCegarLoop]: 1043 mSDtfsCounter, 1695 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:33,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 2129 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-23 04:32:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2022-07-23 04:32:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 4432. [2022-07-23 04:32:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 3168 states have (on average 1.238320707070707) internal successors, (3923), 3282 states have internal predecessors, (3923), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 5641 transitions. [2022-07-23 04:32:33,853 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 5641 transitions. Word has length 120 [2022-07-23 04:32:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:33,853 INFO L495 AbstractCegarLoop]: Abstraction has 4432 states and 5641 transitions. [2022-07-23 04:32:33,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:32:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 5641 transitions. [2022-07-23 04:32:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-23 04:32:33,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:33,856 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-07-23 04:32:33,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-23 04:32:33,857 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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 29 more)] === [2022-07-23 04:32:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:33,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1332446756, now seen corresponding path program 1 times [2022-07-23 04:32:33,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:33,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769620672] [2022-07-23 04:32:33,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:33,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:34,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:32:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769620672] [2022-07-23 04:32:34,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769620672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:34,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:34,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422792128] [2022-07-23 04:32:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:34,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:34,042 INFO L87 Difference]: Start difference. First operand 4432 states and 5641 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:32:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:35,627 INFO L93 Difference]: Finished difference Result 4432 states and 5641 transitions. [2022-07-23 04:32:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:35,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-23 04:32:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:35,637 INFO L225 Difference]: With dead ends: 4432 [2022-07-23 04:32:35,637 INFO L226 Difference]: Without dead ends: 4430 [2022-07-23 04:32:35,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:35,639 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 1689 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:35,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 2127 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:32:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2022-07-23 04:32:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 4430. [2022-07-23 04:32:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 3167 states have (on average 1.2377644458478054) internal successors, (3920), 3280 states have internal predecessors, (3920), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 5638 transitions. [2022-07-23 04:32:36,210 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 5638 transitions. Word has length 126 [2022-07-23 04:32:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:36,210 INFO L495 AbstractCegarLoop]: Abstraction has 4430 states and 5638 transitions. [2022-07-23 04:32:36,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:32:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 5638 transitions. [2022-07-23 04:32:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-23 04:32:36,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:36,213 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:36,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-23 04:32:36,213 INFO L420 AbstractCegarLoop]: === Iteration 32 === 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 29 more)] === [2022-07-23 04:32:36,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash -552239519, now seen corresponding path program 1 times [2022-07-23 04:32:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:36,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79076665] [2022-07-23 04:32:36,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:32:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:32:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:36,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:36,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79076665] [2022-07-23 04:32:36,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79076665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:36,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:36,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762801261] [2022-07-23 04:32:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:36,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:36,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:36,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:36,390 INFO L87 Difference]: Start difference. First operand 4430 states and 5638 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:32:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:38,114 INFO L93 Difference]: Finished difference Result 4430 states and 5638 transitions. [2022-07-23 04:32:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:38,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-23 04:32:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:38,125 INFO L225 Difference]: With dead ends: 4430 [2022-07-23 04:32:38,126 INFO L226 Difference]: Without dead ends: 4428 [2022-07-23 04:32:38,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:38,129 INFO L413 NwaCegarLoop]: 1039 mSDtfsCounter, 1683 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:38,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 2125 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2022-07-23 04:32:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4428. [2022-07-23 04:32:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4428 states, 3166 states have (on average 1.237207833228048) internal successors, (3917), 3278 states have internal predecessors, (3917), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 5635 transitions. [2022-07-23 04:32:38,723 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 5635 transitions. Word has length 132 [2022-07-23 04:32:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:38,723 INFO L495 AbstractCegarLoop]: Abstraction has 4428 states and 5635 transitions. [2022-07-23 04:32:38,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:32:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 5635 transitions. [2022-07-23 04:32:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 04:32:38,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:38,727 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:38,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-23 04:32:38,727 INFO L420 AbstractCegarLoop]: === Iteration 33 === 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 29 more)] === [2022-07-23 04:32:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1158403546, now seen corresponding path program 1 times [2022-07-23 04:32:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:38,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099066271] [2022-07-23 04:32:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:32:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:32:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:32:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:38,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099066271] [2022-07-23 04:32:38,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099066271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:38,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:38,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894248967] [2022-07-23 04:32:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:38,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:38,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:38,921 INFO L87 Difference]: Start difference. First operand 4428 states and 5635 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:32:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:40,689 INFO L93 Difference]: Finished difference Result 4428 states and 5635 transitions. [2022-07-23 04:32:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-23 04:32:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:40,698 INFO L225 Difference]: With dead ends: 4428 [2022-07-23 04:32:40,698 INFO L226 Difference]: Without dead ends: 4426 [2022-07-23 04:32:40,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:40,700 INFO L413 NwaCegarLoop]: 1037 mSDtfsCounter, 1677 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:40,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1768 Valid, 2123 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2022-07-23 04:32:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 4426. [2022-07-23 04:32:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 3165 states have (on average 1.236650868878357) internal successors, (3914), 3276 states have internal predecessors, (3914), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 5632 transitions. [2022-07-23 04:32:41,263 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 5632 transitions. Word has length 138 [2022-07-23 04:32:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:41,263 INFO L495 AbstractCegarLoop]: Abstraction has 4426 states and 5632 transitions. [2022-07-23 04:32:41,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:32:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 5632 transitions. [2022-07-23 04:32:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-23 04:32:41,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:41,267 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:41,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-23 04:32:41,267 INFO L420 AbstractCegarLoop]: === Iteration 34 === 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 29 more)] === [2022-07-23 04:32:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash -505486468, now seen corresponding path program 1 times [2022-07-23 04:32:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:41,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067478796] [2022-07-23 04:32:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:32:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:32:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:32:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:32:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:41,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067478796] [2022-07-23 04:32:41,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067478796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:41,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:41,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180476001] [2022-07-23 04:32:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:41,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:41,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:41,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:41,462 INFO L87 Difference]: Start difference. First operand 4426 states and 5632 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:32:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:43,219 INFO L93 Difference]: Finished difference Result 4426 states and 5632 transitions. [2022-07-23 04:32:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:43,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-23 04:32:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:43,229 INFO L225 Difference]: With dead ends: 4426 [2022-07-23 04:32:43,229 INFO L226 Difference]: Without dead ends: 4424 [2022-07-23 04:32:43,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:43,231 INFO L413 NwaCegarLoop]: 1035 mSDtfsCounter, 1671 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:43,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 2121 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:32:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2022-07-23 04:32:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 4424. [2022-07-23 04:32:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 3164 states have (on average 1.236093552465234) internal successors, (3911), 3274 states have internal predecessors, (3911), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 5629 transitions. [2022-07-23 04:32:43,803 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 5629 transitions. Word has length 144 [2022-07-23 04:32:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:43,804 INFO L495 AbstractCegarLoop]: Abstraction has 4424 states and 5629 transitions. [2022-07-23 04:32:43,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:32:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 5629 transitions. [2022-07-23 04:32:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 04:32:43,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:43,807 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:43,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-23 04:32:43,808 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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 29 more)] === [2022-07-23 04:32:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1336328270, now seen corresponding path program 1 times [2022-07-23 04:32:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129621700] [2022-07-23 04:32:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:32:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:43,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:32:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:44,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:32:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:44,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:32:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:44,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:32:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:44,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:44,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129621700] [2022-07-23 04:32:44,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129621700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:44,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:44,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:44,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813883796] [2022-07-23 04:32:44,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:44,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:44,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:44,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:44,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:44,022 INFO L87 Difference]: Start difference. First operand 4424 states and 5629 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:32:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:45,749 INFO L93 Difference]: Finished difference Result 4424 states and 5629 transitions. [2022-07-23 04:32:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:45,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-23 04:32:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:45,759 INFO L225 Difference]: With dead ends: 4424 [2022-07-23 04:32:45,759 INFO L226 Difference]: Without dead ends: 4422 [2022-07-23 04:32:45,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:45,761 INFO L413 NwaCegarLoop]: 1033 mSDtfsCounter, 1665 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:45,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 2119 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:32:45,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2022-07-23 04:32:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 4422. [2022-07-23 04:32:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4422 states, 3163 states have (on average 1.235535883654758) internal successors, (3908), 3272 states have internal predecessors, (3908), 854 states have call successors, (854), 397 states have call predecessors, (854), 393 states have return successors, (864), 828 states have call predecessors, (864), 852 states have call successors, (864) [2022-07-23 04:32:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 5626 transitions. [2022-07-23 04:32:46,342 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 5626 transitions. Word has length 150 [2022-07-23 04:32:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:46,342 INFO L495 AbstractCegarLoop]: Abstraction has 4422 states and 5626 transitions. [2022-07-23 04:32:46,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:32:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 5626 transitions. [2022-07-23 04:32:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-23 04:32:46,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:46,346 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:46,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-23 04:32:46,346 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:32:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1212160695, now seen corresponding path program 1 times [2022-07-23 04:32:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:46,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110634157] [2022-07-23 04:32:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:46,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:32:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:32:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:32:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-23 04:32:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:32:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 04:32:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:32:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:32:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 04:32:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:32:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:32:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:32:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:32:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-23 04:32:46,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:46,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110634157] [2022-07-23 04:32:46,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110634157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:32:46,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942320925] [2022-07-23 04:32:46,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:46,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:32:46,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:32:46,747 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:32:46,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 04:32:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:47,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 04:32:47,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:32:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-23 04:32:47,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:32:47,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942320925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:47,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:32:47,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [19] total 27 [2022-07-23 04:32:47,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744868361] [2022-07-23 04:32:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:47,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:32:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:32:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2022-07-23 04:32:47,359 INFO L87 Difference]: Start difference. First operand 4422 states and 5626 transitions. Second operand has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 7 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-07-23 04:32:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:48,601 INFO L93 Difference]: Finished difference Result 6844 states and 8642 transitions. [2022-07-23 04:32:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 04:32:48,602 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 7 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 154 [2022-07-23 04:32:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:48,613 INFO L225 Difference]: With dead ends: 6844 [2022-07-23 04:32:48,613 INFO L226 Difference]: Without dead ends: 4491 [2022-07-23 04:32:48,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1475, Unknown=0, NotChecked=0, Total=1722 [2022-07-23 04:32:48,620 INFO L413 NwaCegarLoop]: 1158 mSDtfsCounter, 54 mSDsluCounter, 14591 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 15749 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:48,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 15749 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:32:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-07-23 04:32:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4443. [2022-07-23 04:32:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4443 states, 3172 states have (on average 1.2348675914249685) internal successors, (3917), 3284 states have internal predecessors, (3917), 866 states have call successors, (866), 397 states have call predecessors, (866), 393 states have return successors, (879), 837 states have call predecessors, (879), 864 states have call successors, (879) [2022-07-23 04:32:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 5662 transitions. [2022-07-23 04:32:49,239 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 5662 transitions. Word has length 154 [2022-07-23 04:32:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:49,240 INFO L495 AbstractCegarLoop]: Abstraction has 4443 states and 5662 transitions. [2022-07-23 04:32:49,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 7 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-07-23 04:32:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 5662 transitions. [2022-07-23 04:32:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-23 04:32:49,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:49,243 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:49,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-23 04:32:49,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-23 04:32:49,444 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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 29 more)] === [2022-07-23 04:32:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash 65566663, now seen corresponding path program 1 times [2022-07-23 04:32:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:49,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974220602] [2022-07-23 04:32:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:32:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:32:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:32:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:32:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:32:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:32:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:49,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974220602] [2022-07-23 04:32:49,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974220602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:49,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:49,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442145353] [2022-07-23 04:32:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:49,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:49,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:49,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:49,675 INFO L87 Difference]: Start difference. First operand 4443 states and 5662 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:32:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:51,370 INFO L93 Difference]: Finished difference Result 4443 states and 5662 transitions. [2022-07-23 04:32:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:51,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-07-23 04:32:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:51,387 INFO L225 Difference]: With dead ends: 4443 [2022-07-23 04:32:51,388 INFO L226 Difference]: Without dead ends: 4441 [2022-07-23 04:32:51,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:51,391 INFO L413 NwaCegarLoop]: 1031 mSDtfsCounter, 1659 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:51,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 2117 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:32:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4441 states. [2022-07-23 04:32:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4441 to 4441. [2022-07-23 04:32:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4441 states, 3171 states have (on average 1.2343109429202144) internal successors, (3914), 3282 states have internal predecessors, (3914), 866 states have call successors, (866), 397 states have call predecessors, (866), 393 states have return successors, (879), 837 states have call predecessors, (879), 864 states have call successors, (879) [2022-07-23 04:32:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4441 states to 4441 states and 5659 transitions. [2022-07-23 04:32:52,015 INFO L78 Accepts]: Start accepts. Automaton has 4441 states and 5659 transitions. Word has length 156 [2022-07-23 04:32:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:52,015 INFO L495 AbstractCegarLoop]: Abstraction has 4441 states and 5659 transitions. [2022-07-23 04:32:52,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:32:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4441 states and 5659 transitions. [2022-07-23 04:32:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-23 04:32:52,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:52,021 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:52,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-23 04:32:52,022 INFO L420 AbstractCegarLoop]: === Iteration 38 === 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 29 more)] === [2022-07-23 04:32:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2231975, now seen corresponding path program 1 times [2022-07-23 04:32:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:52,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066919397] [2022-07-23 04:32:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:32:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:32:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:32:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:32:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:32:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:32:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:32:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:32:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:32:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:32:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:32:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:32:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:32:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:32:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:32:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:32:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:32:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:32:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:32:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:32:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:52,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066919397] [2022-07-23 04:32:52,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066919397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:52,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:52,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:32:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269474415] [2022-07-23 04:32:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:52,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:32:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:32:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:32:52,221 INFO L87 Difference]: Start difference. First operand 4441 states and 5659 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 04:32:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:53,979 INFO L93 Difference]: Finished difference Result 4441 states and 5659 transitions. [2022-07-23 04:32:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:32:53,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-07-23 04:32:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:53,989 INFO L225 Difference]: With dead ends: 4441 [2022-07-23 04:32:53,990 INFO L226 Difference]: Without dead ends: 4439 [2022-07-23 04:32:53,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:32:53,992 INFO L413 NwaCegarLoop]: 1029 mSDtfsCounter, 1653 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:53,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 2115 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:32:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4439 states. [2022-07-23 04:32:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4439 to 4439. [2022-07-23 04:32:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 3170 states have (on average 1.2337539432176656) internal successors, (3911), 3280 states have internal predecessors, (3911), 866 states have call successors, (866), 397 states have call predecessors, (866), 393 states have return successors, (879), 837 states have call predecessors, (879), 864 states have call successors, (879) [2022-07-23 04:32:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 5656 transitions. [2022-07-23 04:32:54,664 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 5656 transitions. Word has length 162 [2022-07-23 04:32:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:54,665 INFO L495 AbstractCegarLoop]: Abstraction has 4439 states and 5656 transitions. [2022-07-23 04:32:54,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 04:32:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 5656 transitions. [2022-07-23 04:32:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-23 04:32:54,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:54,669 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:54,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-23 04:32:54,669 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:32:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1771411686, now seen corresponding path program 1 times [2022-07-23 04:32:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:54,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930218574] [2022-07-23 04:32:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:32:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:32:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:32:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:32:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:32:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 04:32:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:32:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 04:32:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:32:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:32:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:32:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:32:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:32:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:32:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:32:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 04:32:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-23 04:32:54,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:54,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930218574] [2022-07-23 04:32:54,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930218574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:54,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:54,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:32:54,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253950059] [2022-07-23 04:32:54,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:54,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:32:54,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:54,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:32:54,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:32:54,885 INFO L87 Difference]: Start difference. First operand 4439 states and 5656 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-23 04:32:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:32:56,980 INFO L93 Difference]: Finished difference Result 8822 states and 11288 transitions. [2022-07-23 04:32:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:32:56,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 166 [2022-07-23 04:32:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:32:56,993 INFO L225 Difference]: With dead ends: 8822 [2022-07-23 04:32:56,993 INFO L226 Difference]: Without dead ends: 4761 [2022-07-23 04:32:57,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:32:57,001 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 2056 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 1002 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1002 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:32:57,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 2237 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1002 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-23 04:32:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2022-07-23 04:32:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4483. [2022-07-23 04:32:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4483 states, 3194 states have (on average 1.2301189730745148) internal successors, (3929), 3308 states have internal predecessors, (3929), 878 states have call successors, (878), 397 states have call predecessors, (878), 401 states have return successors, (908), 853 states have call predecessors, (908), 876 states have call successors, (908) [2022-07-23 04:32:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 5715 transitions. [2022-07-23 04:32:57,627 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 5715 transitions. Word has length 166 [2022-07-23 04:32:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:32:57,628 INFO L495 AbstractCegarLoop]: Abstraction has 4483 states and 5715 transitions. [2022-07-23 04:32:57,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-23 04:32:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 5715 transitions. [2022-07-23 04:32:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-23 04:32:57,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:32:57,632 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:32:57,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-23 04:32:57,632 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:32:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:32:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1342326494, now seen corresponding path program 1 times [2022-07-23 04:32:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:32:57,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795631858] [2022-07-23 04:32:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:32:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:32:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:32:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:32:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:32:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-23 04:32:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:32:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:32:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-23 04:32:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:32:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-23 04:32:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:32:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:32:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:32:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:32:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:32:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:32:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 04:32:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:32:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:32:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:32:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:32:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:32:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-23 04:32:57,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:32:57,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795631858] [2022-07-23 04:32:57,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795631858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:32:57,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:32:57,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 04:32:57,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722043363] [2022-07-23 04:32:57,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:32:57,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 04:32:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:32:57,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 04:32:57,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-23 04:32:57,935 INFO L87 Difference]: Start difference. First operand 4483 states and 5715 transitions. Second operand has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (26), 7 states have call predecessors, (26), 3 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-23 04:33:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:33:02,224 INFO L93 Difference]: Finished difference Result 9030 states and 11571 transitions. [2022-07-23 04:33:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:33:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (26), 7 states have call predecessors, (26), 3 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) Word has length 182 [2022-07-23 04:33:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:33:02,238 INFO L225 Difference]: With dead ends: 9030 [2022-07-23 04:33:02,238 INFO L226 Difference]: Without dead ends: 4773 [2022-07-23 04:33:02,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-07-23 04:33:02,248 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 1567 mSDsluCounter, 3816 mSDsCounter, 0 mSdLazyCounter, 5062 mSolverCounterSat, 1081 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 4810 SdHoareTripleChecker+Invalid, 6143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 5062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:33:02,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 4810 Invalid, 6143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1081 Valid, 5062 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 04:33:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2022-07-23 04:33:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 4510. [2022-07-23 04:33:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 3212 states have (on average 1.2288293897882938) internal successors, (3947), 3326 states have internal predecessors, (3947), 881 states have call successors, (881), 397 states have call predecessors, (881), 407 states have return successors, (929), 862 states have call predecessors, (929), 879 states have call successors, (929) [2022-07-23 04:33:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5757 transitions. [2022-07-23 04:33:02,922 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5757 transitions. Word has length 182 [2022-07-23 04:33:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:33:02,922 INFO L495 AbstractCegarLoop]: Abstraction has 4510 states and 5757 transitions. [2022-07-23 04:33:02,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (26), 7 states have call predecessors, (26), 3 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-23 04:33:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5757 transitions. [2022-07-23 04:33:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-23 04:33:02,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:33:02,926 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:33:02,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-23 04:33:02,926 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:33:02,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:33:02,927 INFO L85 PathProgramCache]: Analyzing trace with hash -138146001, now seen corresponding path program 1 times [2022-07-23 04:33:02,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:33:02,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488856634] [2022-07-23 04:33:02,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:02,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:33:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:33:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:33:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:33:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:33:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:33:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:33:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:33:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:33:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:33:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:33:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:33:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:33:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:33:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:33:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:33:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:33:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:33:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:33:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:33:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:33:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:33:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:33:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:33:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:33:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:33:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 04:33:03,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:33:03,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488856634] [2022-07-23 04:33:03,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488856634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:33:03,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:33:03,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:33:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187687593] [2022-07-23 04:33:03,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:33:03,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:33:03,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:33:03,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:33:03,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:33:03,143 INFO L87 Difference]: Start difference. First operand 4510 states and 5757 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 04:33:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:33:04,839 INFO L93 Difference]: Finished difference Result 4510 states and 5757 transitions. [2022-07-23 04:33:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:33:04,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-07-23 04:33:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:33:04,854 INFO L225 Difference]: With dead ends: 4510 [2022-07-23 04:33:04,854 INFO L226 Difference]: Without dead ends: 4192 [2022-07-23 04:33:04,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:33:04,858 INFO L413 NwaCegarLoop]: 1024 mSDtfsCounter, 1640 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:33:04,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 2098 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 04:33:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2022-07-23 04:33:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4189. [2022-07-23 04:33:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 2998 states have (on average 1.2284856571047365) internal successors, (3683), 3105 states have internal predecessors, (3683), 808 states have call successors, (808), 366 states have call predecessors, (808), 374 states have return successors, (843), 793 states have call predecessors, (843), 805 states have call successors, (843) [2022-07-23 04:33:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 5334 transitions. [2022-07-23 04:33:05,435 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 5334 transitions. Word has length 168 [2022-07-23 04:33:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:33:05,435 INFO L495 AbstractCegarLoop]: Abstraction has 4189 states and 5334 transitions. [2022-07-23 04:33:05,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 04:33:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 5334 transitions. [2022-07-23 04:33:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-23 04:33:05,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:33:05,439 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:33:05,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-23 04:33:05,440 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:33:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:33:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1723539442, now seen corresponding path program 1 times [2022-07-23 04:33:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:33:05,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582176421] [2022-07-23 04:33:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:33:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:33:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:33:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:33:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:33:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:33:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:33:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 04:33:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-23 04:33:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:33:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:33:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 04:33:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:33:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:33:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 04:33:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:33:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 04:33:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:33:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:33:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:33:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-23 04:33:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:33:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582176421] [2022-07-23 04:33:05,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582176421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:33:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627956802] [2022-07-23 04:33:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:33:05,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:33:05,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:33:05,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-23 04:33:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:06,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-23 04:33:06,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:33:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-23 04:33:06,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:33:06,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627956802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:33:06,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:33:06,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [19] total 21 [2022-07-23 04:33:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442242731] [2022-07-23 04:33:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:33:06,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:33:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:33:06,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:33:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-07-23 04:33:06,461 INFO L87 Difference]: Start difference. First operand 4189 states and 5334 transitions. Second operand has 15 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 7 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-07-23 04:33:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:33:07,394 INFO L93 Difference]: Finished difference Result 6401 states and 8106 transitions. [2022-07-23 04:33:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:33:07,399 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 7 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 183 [2022-07-23 04:33:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:33:07,411 INFO L225 Difference]: With dead ends: 6401 [2022-07-23 04:33:07,411 INFO L226 Difference]: Without dead ends: 4060 [2022-07-23 04:33:07,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-07-23 04:33:07,419 INFO L413 NwaCegarLoop]: 934 mSDtfsCounter, 36 mSDsluCounter, 12059 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 12993 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:33:07,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 12993 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 04:33:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2022-07-23 04:33:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3958. [2022-07-23 04:33:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 2828 states have (on average 1.2093352192362092) internal successors, (3420), 2932 states have internal predecessors, (3420), 760 states have call successors, (760), 353 states have call predecessors, (760), 361 states have return successors, (785), 748 states have call predecessors, (785), 757 states have call successors, (785) [2022-07-23 04:33:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 4965 transitions. [2022-07-23 04:33:07,970 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 4965 transitions. Word has length 183 [2022-07-23 04:33:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:33:07,970 INFO L495 AbstractCegarLoop]: Abstraction has 3958 states and 4965 transitions. [2022-07-23 04:33:07,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 7 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2022-07-23 04:33:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 4965 transitions. [2022-07-23 04:33:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-23 04:33:07,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:33:07,973 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:33:07,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-23 04:33:08,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:33:08,174 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:33:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:33:08,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2089840695, now seen corresponding path program 1 times [2022-07-23 04:33:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:33:08,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544742315] [2022-07-23 04:33:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:33:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:33:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:33:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:33:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:33:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:33:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:33:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 04:33:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:33:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:33:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:33:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:33:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:33:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:33:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-23 04:33:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:33:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-23 04:33:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-23 04:33:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:33:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:33:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-23 04:33:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-23 04:33:08,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:33:08,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544742315] [2022-07-23 04:33:08,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544742315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:33:08,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:33:08,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:33:08,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682762854] [2022-07-23 04:33:08,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:33:08,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:33:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:33:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:33:08,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:33:08,389 INFO L87 Difference]: Start difference. First operand 3958 states and 4965 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (32), 6 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-23 04:33:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:33:09,890 INFO L93 Difference]: Finished difference Result 7666 states and 9653 transitions. [2022-07-23 04:33:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:33:09,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (32), 6 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 224 [2022-07-23 04:33:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:33:09,901 INFO L225 Difference]: With dead ends: 7666 [2022-07-23 04:33:09,901 INFO L226 Difference]: Without dead ends: 4158 [2022-07-23 04:33:09,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:33:09,908 INFO L413 NwaCegarLoop]: 837 mSDtfsCounter, 2159 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 1135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2235 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1135 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:33:09,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2235 Valid, 1687 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1135 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 04:33:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2022-07-23 04:33:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 3958. [2022-07-23 04:33:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 2828 states have (on average 1.2068599717114568) internal successors, (3413), 2932 states have internal predecessors, (3413), 760 states have call successors, (760), 353 states have call predecessors, (760), 361 states have return successors, (785), 748 states have call predecessors, (785), 757 states have call successors, (785) [2022-07-23 04:33:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 4958 transitions. [2022-07-23 04:33:10,478 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 4958 transitions. Word has length 224 [2022-07-23 04:33:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:33:10,479 INFO L495 AbstractCegarLoop]: Abstraction has 3958 states and 4958 transitions. [2022-07-23 04:33:10,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (32), 6 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-23 04:33:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 4958 transitions. [2022-07-23 04:33:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-23 04:33:10,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:33:10,482 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:33:10,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-23 04:33:10,483 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:33:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:33:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash -483578991, now seen corresponding path program 1 times [2022-07-23 04:33:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:33:10,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745287840] [2022-07-23 04:33:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:33:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:33:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:33:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-23 04:33:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:33:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:33:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:33:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:33:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:33:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:33:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:33:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 04:33:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-23 04:33:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-23 04:33:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-23 04:33:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-23 04:33:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-23 04:33:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-23 04:33:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:33:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:33:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-23 04:33:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-23 04:33:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:33:10,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745287840] [2022-07-23 04:33:10,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745287840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:33:10,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:33:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:33:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821017431] [2022-07-23 04:33:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:33:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:33:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:33:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:33:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:33:10,737 INFO L87 Difference]: Start difference. First operand 3958 states and 4958 transitions. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-23 04:33:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:33:12,722 INFO L93 Difference]: Finished difference Result 7624 states and 9590 transitions. [2022-07-23 04:33:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:33:12,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 241 [2022-07-23 04:33:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:33:12,739 INFO L225 Difference]: With dead ends: 7624 [2022-07-23 04:33:12,739 INFO L226 Difference]: Without dead ends: 4158 [2022-07-23 04:33:12,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:33:12,747 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 2436 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 1342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2511 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1342 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:33:12,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2511 Valid, 1669 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1342 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:33:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2022-07-23 04:33:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 3958. [2022-07-23 04:33:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 2828 states have (on average 1.2043847241867043) internal successors, (3406), 2932 states have internal predecessors, (3406), 760 states have call successors, (760), 353 states have call predecessors, (760), 361 states have return successors, (785), 748 states have call predecessors, (785), 757 states have call successors, (785) [2022-07-23 04:33:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 4951 transitions. [2022-07-23 04:33:13,335 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 4951 transitions. Word has length 241 [2022-07-23 04:33:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:33:13,335 INFO L495 AbstractCegarLoop]: Abstraction has 3958 states and 4951 transitions. [2022-07-23 04:33:13,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-23 04:33:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 4951 transitions. [2022-07-23 04:33:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-07-23 04:33:13,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:33:13,338 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:33:13,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-23 04:33:13,338 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:33:13,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:33:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash 42876981, now seen corresponding path program 1 times [2022-07-23 04:33:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:33:13,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638698253] [2022-07-23 04:33:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:33:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:33:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:33:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-23 04:33:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:33:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:33:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:33:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:33:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:33:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:33:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:33:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:33:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:33:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:33:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-23 04:33:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:33:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-23 04:33:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-23 04:33:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:33:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:33:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:33:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-23 04:33:13,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:33:13,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638698253] [2022-07-23 04:33:13,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638698253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:33:13,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:33:13,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:33:13,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828417869] [2022-07-23 04:33:13,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:33:13,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:33:13,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:33:13,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:33:13,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:33:13,605 INFO L87 Difference]: Start difference. First operand 3958 states and 4951 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-23 04:33:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:33:15,602 INFO L93 Difference]: Finished difference Result 7322 states and 9226 transitions. [2022-07-23 04:33:15,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:33:15,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 243 [2022-07-23 04:33:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:33:15,614 INFO L225 Difference]: With dead ends: 7322 [2022-07-23 04:33:15,614 INFO L226 Difference]: Without dead ends: 4158 [2022-07-23 04:33:15,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:33:15,621 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 1848 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 941 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 941 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:33:15,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 1912 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [941 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-23 04:33:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2022-07-23 04:33:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 3958. [2022-07-23 04:33:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 2828 states have (on average 1.2033239038189534) internal successors, (3403), 2932 states have internal predecessors, (3403), 760 states have call successors, (760), 353 states have call predecessors, (760), 361 states have return successors, (785), 748 states have call predecessors, (785), 757 states have call successors, (785) [2022-07-23 04:33:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 4948 transitions. [2022-07-23 04:33:16,202 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 4948 transitions. Word has length 243 [2022-07-23 04:33:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:33:16,203 INFO L495 AbstractCegarLoop]: Abstraction has 3958 states and 4948 transitions. [2022-07-23 04:33:16,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-23 04:33:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 4948 transitions. [2022-07-23 04:33:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-23 04:33:16,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:33:16,206 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:33:16,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-23 04:33:16,206 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:33:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:33:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1150252467, now seen corresponding path program 1 times [2022-07-23 04:33:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:33:16,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546528390] [2022-07-23 04:33:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:33:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:33:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 04:33:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:33:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:33:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:33:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:33:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 04:33:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:33:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:33:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:33:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 04:33:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:33:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:33:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:33:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:33:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-23 04:33:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-23 04:33:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:33:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:33:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:33:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:33:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:33:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-23 04:33:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:33:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-23 04:33:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:33:16,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546528390] [2022-07-23 04:33:16,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546528390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:33:16,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:33:16,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 04:33:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493984114] [2022-07-23 04:33:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:33:16,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 04:33:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:33:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 04:33:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:33:16,533 INFO L87 Difference]: Start difference. First operand 3958 states and 4948 transitions. Second operand has 14 states, 14 states have (on average 9.0) internal successors, (126), 8 states have internal predecessors, (126), 3 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-23 04:33:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:33:22,254 INFO L93 Difference]: Finished difference Result 9684 states and 12111 transitions. [2022-07-23 04:33:22,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 04:33:22,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 8 states have internal predecessors, (126), 3 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) Word has length 234 [2022-07-23 04:33:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:33:22,275 INFO L225 Difference]: With dead ends: 9684 [2022-07-23 04:33:22,275 INFO L226 Difference]: Without dead ends: 6196 [2022-07-23 04:33:22,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2022-07-23 04:33:22,288 INFO L413 NwaCegarLoop]: 1277 mSDtfsCounter, 2384 mSDsluCounter, 5095 mSDsCounter, 0 mSdLazyCounter, 8034 mSolverCounterSat, 1493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2430 SdHoareTripleChecker+Valid, 6372 SdHoareTripleChecker+Invalid, 9527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1493 IncrementalHoareTripleChecker+Valid, 8034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:33:22,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2430 Valid, 6372 Invalid, 9527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1493 Valid, 8034 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-23 04:33:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2022-07-23 04:33:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 5688. [2022-07-23 04:33:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5688 states, 4030 states have (on average 1.2034739454094292) internal successors, (4850), 4181 states have internal predecessors, (4850), 1106 states have call successors, (1106), 519 states have call predecessors, (1106), 543 states have return successors, (1168), 1099 states have call predecessors, (1168), 1103 states have call successors, (1168) [2022-07-23 04:33:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5688 states to 5688 states and 7124 transitions. [2022-07-23 04:33:23,195 INFO L78 Accepts]: Start accepts. Automaton has 5688 states and 7124 transitions. Word has length 234 [2022-07-23 04:33:23,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:33:23,196 INFO L495 AbstractCegarLoop]: Abstraction has 5688 states and 7124 transitions. [2022-07-23 04:33:23,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 8 states have internal predecessors, (126), 3 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-23 04:33:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5688 states and 7124 transitions. [2022-07-23 04:33:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-23 04:33:23,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:33:23,199 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:33:23,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-23 04:33:23,200 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ldv_linux_kernel_locking_rwlock_write_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-07-23 04:33:23,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:33:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash 539066008, now seen corresponding path program 1 times [2022-07-23 04:33:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:33:23,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486727243] [2022-07-23 04:33:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:33:23,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-23 04:33:23,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034269860] [2022-07-23 04:33:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:33:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:33:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:33:23,256 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:33:23,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process