./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.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-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.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 6b2cae6d498f7aa4576ffcfd28b3f955c7840001d7c2abb7c90b6970c97881d1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 02:33:09,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 02:33:09,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 02:33:09,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 02:33:09,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 02:33:09,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 02:33:09,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 02:33:09,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 02:33:09,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 02:33:09,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 02:33:09,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 02:33:09,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 02:33:09,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 02:33:09,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 02:33:09,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 02:33:09,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 02:33:09,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 02:33:09,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 02:33:09,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 02:33:09,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 02:33:09,856 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 02:33:09,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 02:33:09,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 02:33:09,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 02:33:09,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 02:33:09,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 02:33:09,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 02:33:09,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 02:33:09,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 02:33:09,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 02:33:09,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 02:33:09,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 02:33:09,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 02:33:09,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 02:33:09,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 02:33:09,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 02:33:09,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 02:33:09,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 02:33:09,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 02:33:09,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 02:33:09,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 02:33:09,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 02:33:09,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 02:33:09,897 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 02:33:09,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 02:33:09,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 02:33:09,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 02:33:09,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 02:33:09,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 02:33:09,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 02:33:09,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 02:33:09,899 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 02:33:09,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 02:33:09,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 02:33:09,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 02:33:09,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 02:33:09,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 02:33:09,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 02:33:09,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 02:33:09,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 02:33:09,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 02:33:09,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 02:33:09,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 02:33:09,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 02:33:09,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 02:33:09,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 02:33:09,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 02:33:09,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 02:33:09,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 02:33:09,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 02:33:09,902 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 02:33:09,902 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 02:33:09,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 02:33:09,903 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 -> 6b2cae6d498f7aa4576ffcfd28b3f955c7840001d7c2abb7c90b6970c97881d1 [2022-07-23 02:33:10,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 02:33:10,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 02:33:10,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 02:33:10,187 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 02:33:10,188 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 02:33:10,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i [2022-07-23 02:33:10,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e74ed704/07a525b0211d41af96cac934d0f1c8f4/FLAG861468d00 [2022-07-23 02:33:11,018 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 02:33:11,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i [2022-07-23 02:33:11,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e74ed704/07a525b0211d41af96cac934d0f1c8f4/FLAG861468d00 [2022-07-23 02:33:11,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e74ed704/07a525b0211d41af96cac934d0f1c8f4 [2022-07-23 02:33:11,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 02:33:11,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 02:33:11,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 02:33:11,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 02:33:11,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 02:33:11,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:33:11" (1/1) ... [2022-07-23 02:33:11,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1441525f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:11, skipping insertion in model container [2022-07-23 02:33:11,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:33:11" (1/1) ... [2022-07-23 02:33:11,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 02:33:11,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 02:33:14,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[314801,314814] [2022-07-23 02:33:14,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[314970,314983] [2022-07-23 02:33:14,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[315137,315150] [2022-07-23 02:33:14,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[315305,315318] [2022-07-23 02:33:14,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 02:33:14,195 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 02:33:14,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[314801,314814] [2022-07-23 02:33:14,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[314970,314983] [2022-07-23 02:33:14,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[315137,315150] [2022-07-23 02:33:14,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[315305,315318] [2022-07-23 02:33:14,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 02:33:14,711 INFO L208 MainTranslator]: Completed translation [2022-07-23 02:33:14,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14 WrapperNode [2022-07-23 02:33:14,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 02:33:14,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 02:33:14,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 02:33:14,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 02:33:14,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:14,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:14,991 INFO L137 Inliner]: procedures = 391, calls = 1784, calls flagged for inlining = 177, calls inlined = 156, statements flattened = 4311 [2022-07-23 02:33:14,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 02:33:14,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 02:33:14,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 02:33:14,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 02:33:15,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:15,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:15,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:15,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:15,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:15,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:15,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:15,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 02:33:15,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 02:33:15,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 02:33:15,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 02:33:15,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (1/1) ... [2022-07-23 02:33:15,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 02:33:15,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 02:33:15,309 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 02:33:15,331 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 02:33:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 02:33:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 02:33:15,349 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2022-07-23 02:33:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2022-07-23 02:33:15,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 02:33:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 02:33:15,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 02:33:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 02:33:15,350 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-23 02:33:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-23 02:33:15,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_66 [2022-07-23 02:33:15,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_66 [2022-07-23 02:33:15,350 INFO L130 BoogieDeclarations]: Found specification of procedure dev_trans_start [2022-07-23 02:33:15,351 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_trans_start [2022-07-23 02:33:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_open [2022-07-23 02:33:15,351 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_open [2022-07-23 02:33:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_load_eeprom [2022-07-23 02:33:15,351 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_load_eeprom [2022-07-23 02:33:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 02:33:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_sense_lan [2022-07-23 02:33:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_sense_lan [2022-07-23 02:33:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 02:33:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 02:33:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-23 02:33:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-23 02:33:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-23 02:33:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-23 02:33:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 02:33:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 02:33:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-23 02:33:15,354 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-23 02:33:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 02:33:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-23 02:33:15,354 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-23 02:33:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_word [2022-07-23 02:33:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_word [2022-07-23 02:33:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-23 02:33:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-23 02:33:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_cascade_reset [2022-07-23 02:33:15,356 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_cascade_reset [2022-07-23 02:33:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 02:33:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-23 02:33:15,356 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-23 02:33:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 02:33:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 02:33:15,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 02:33:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 02:33:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-23 02:33:15,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-23 02:33:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 02:33:15,358 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 02:33:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_rx_bm [2022-07-23 02:33:15,359 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_rx_bm [2022-07-23 02:33:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_BM_shutdown [2022-07-23 02:33:15,359 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_BM_shutdown [2022-07-23 02:33:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-23 02:33:15,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-23 02:33:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-23 02:33:15,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-23 02:33:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure wait [2022-07-23 02:33:15,360 INFO L138 BoogieDeclarations]: Found implementation of procedure wait [2022-07-23 02:33:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-23 02:33:15,360 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-23 02:33:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_hwinit [2022-07-23 02:33:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_hwinit [2022-07-23 02:33:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-23 02:33:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-23 02:33:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_whatever [2022-07-23 02:33:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_whatever [2022-07-23 02:33:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_close [2022-07-23 02:33:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_close [2022-07-23 02:33:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-23 02:33:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-23 02:33:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 02:33:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_stop_interface [2022-07-23 02:33:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_stop_interface [2022-07-23 02:33:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_check_lan [2022-07-23 02:33:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_check_lan [2022-07-23 02:33:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-07-23 02:33:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-07-23 02:33:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 02:33:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 02:33:15,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 02:33:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-23 02:33:15,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-23 02:33:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 02:33:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-23 02:33:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 02:33:15,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 02:33:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 02:33:15,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 02:33:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-23 02:33:15,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-23 02:33:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_rxfill [2022-07-23 02:33:15,366 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_rxfill [2022-07-23 02:33:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-23 02:33:15,366 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-23 02:33:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-23 02:33:15,367 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-23 02:33:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-23 02:33:15,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-23 02:33:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 02:33:15,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 02:33:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_update_stats [2022-07-23 02:33:15,368 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_update_stats [2022-07-23 02:33:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 02:33:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 02:33:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 02:33:15,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 02:33:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 02:33:15,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 02:33:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-23 02:33:15,370 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-23 02:33:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 02:33:15,372 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 02:33:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-23 02:33:15,372 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-23 02:33:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 02:33:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 02:33:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 02:33:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 02:33:15,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 02:33:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-07-23 02:33:15,380 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-07-23 02:33:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-23 02:33:15,380 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-23 02:33:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-23 02:33:15,380 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-23 02:33:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 02:33:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 02:33:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-07-23 02:33:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-07-23 02:33:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_pci_remove [2022-07-23 02:33:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_pci_remove [2022-07-23 02:33:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_build_rx_pdl [2022-07-23 02:33:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_build_rx_pdl [2022-07-23 02:33:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-23 02:33:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-23 02:33:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-23 02:33:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-23 02:33:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-23 02:33:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-23 02:33:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_hp100_private [2022-07-23 02:33:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_hp100_private [2022-07-23 02:33:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 02:33:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2022-07-23 02:33:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2022-07-23 02:33:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 02:33:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 02:33:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_hp100_private [2022-07-23 02:33:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_hp100_private [2022-07-23 02:33:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_80 [2022-07-23 02:33:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_80 [2022-07-23 02:33:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2022-07-23 02:33:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2022-07-23 02:33:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-23 02:33:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-23 02:33:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 02:33:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 02:33:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_set_multicast_list [2022-07-23 02:33:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_set_multicast_list [2022-07-23 02:33:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_start_interface [2022-07-23 02:33:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_start_interface [2022-07-23 02:33:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-23 02:33:15,386 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-23 02:33:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_clean_txring [2022-07-23 02:33:15,386 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_clean_txring [2022-07-23 02:33:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-07-23 02:33:15,386 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-07-23 02:33:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 02:33:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure inw [2022-07-23 02:33:15,387 INFO L138 BoogieDeclarations]: Found implementation of procedure inw [2022-07-23 02:33:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-23 02:33:15,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-23 02:33:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_login_to_vg_hub [2022-07-23 02:33:15,388 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_login_to_vg_hub [2022-07-23 02:33:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-23 02:33:15,388 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-23 02:33:16,195 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 02:33:16,199 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 02:33:16,430 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 02:33:18,674 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-23 02:33:18,675 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 02:33:18,842 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563: SUMMARY for call #t~ret698#1 := schedule_timeout_interruptible(1); srcloc: null [2022-07-23 02:33:18,842 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563-1: assume -9223372036854775808 <= #t~ret698#1 && #t~ret698#1 <= 9223372036854775807;havoc #t~ret698#1; [2022-07-23 02:33:18,842 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume 0 == (if 0 == ~tmp___4~7#1 then 0 else (if 1 == ~tmp___4~7#1 then 0 else ~bitwiseAnd(~tmp___4~7#1, 2096896))) % 18446744073709551616; [2022-07-23 02:33:18,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !(0 == (if 0 == ~tmp___4~7#1 then 0 else (if 1 == ~tmp___4~7#1 then 0 else ~bitwiseAnd(~tmp___4~7#1, 2096896))) % 18446744073709551616); [2022-07-23 02:33:18,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8567: assume (if (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 else (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616) < 0; [2022-07-23 02:33:18,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8567: assume !((if (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 else (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616) < 0); [2022-07-23 02:33:18,941 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 02:33:18,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 02:33:18,966 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 02:33:18,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:33:18 BoogieIcfgContainer [2022-07-23 02:33:18,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 02:33:18,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 02:33:18,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 02:33:18,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 02:33:18,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 02:33:11" (1/3) ... [2022-07-23 02:33:18,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca8a348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 02:33:18, skipping insertion in model container [2022-07-23 02:33:18,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:33:14" (2/3) ... [2022-07-23 02:33:18,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca8a348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 02:33:18, skipping insertion in model container [2022-07-23 02:33:18,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:33:18" (3/3) ... [2022-07-23 02:33:18,981 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i [2022-07-23 02:33:18,994 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 02:33:18,995 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-23 02:33:19,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 02:33:19,109 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@723605fd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@589dddc9 [2022-07-23 02:33:19,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-23 02:33:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 1799 states, 1150 states have (on average 1.3217391304347825) internal successors, (1520), 1200 states have internal predecessors, (1520), 568 states have call successors, (568), 80 states have call predecessors, (568), 79 states have return successors, (563), 547 states have call predecessors, (563), 563 states have call successors, (563) [2022-07-23 02:33:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 02:33:19,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:33:19,130 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2022-07-23 02:33:19,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:33:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:33:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1256620244, now seen corresponding path program 1 times [2022-07-23 02:33:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:33:19,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395753219] [2022-07-23 02:33:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:33:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:33:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:33:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:33:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:33:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:33:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:33:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-23 02:33:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 02:33:19,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:33:19,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395753219] [2022-07-23 02:33:19,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395753219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:33:19,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:33:19,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:33:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797289114] [2022-07-23 02:33:19,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:33:19,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:33:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:33:19,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:33:19,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:33:19,804 INFO L87 Difference]: Start difference. First operand has 1799 states, 1150 states have (on average 1.3217391304347825) internal successors, (1520), 1200 states have internal predecessors, (1520), 568 states have call successors, (568), 80 states have call predecessors, (568), 79 states have return successors, (563), 547 states have call predecessors, (563), 563 states have call successors, (563) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 02:33:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:33:25,137 INFO L93 Difference]: Finished difference Result 5452 states and 8256 transitions. [2022-07-23 02:33:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:33:25,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2022-07-23 02:33:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:33:25,207 INFO L225 Difference]: With dead ends: 5452 [2022-07-23 02:33:25,208 INFO L226 Difference]: Without dead ends: 3656 [2022-07-23 02:33:25,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 02:33:25,236 INFO L413 NwaCegarLoop]: 2524 mSDtfsCounter, 3273 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3814 SdHoareTripleChecker+Valid, 4423 SdHoareTripleChecker+Invalid, 4754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-23 02:33:25,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3814 Valid, 4423 Invalid, 4754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2123 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-23 02:33:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2022-07-23 02:33:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3484. [2022-07-23 02:33:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 2231 states have (on average 1.2823845809054235) internal successors, (2861), 2327 states have internal predecessors, (2861), 1095 states have call successors, (1095), 156 states have call predecessors, (1095), 155 states have return successors, (1092), 1060 states have call predecessors, (1092), 1092 states have call successors, (1092) [2022-07-23 02:33:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5048 transitions. [2022-07-23 02:33:25,617 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5048 transitions. Word has length 68 [2022-07-23 02:33:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:33:25,619 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 5048 transitions. [2022-07-23 02:33:25,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 02:33:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5048 transitions. [2022-07-23 02:33:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-23 02:33:25,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:33:25,630 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2022-07-23 02:33:25,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 02:33:25,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:33:25,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:33:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1472747592, now seen corresponding path program 1 times [2022-07-23 02:33:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:33:25,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278740179] [2022-07-23 02:33:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:33:25,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:33:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:33:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:33:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:33:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:33:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:33:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 02:33:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 02:33:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:33:25,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278740179] [2022-07-23 02:33:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278740179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:33:25,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:33:25,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:33:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599692155] [2022-07-23 02:33:25,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:33:25,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:33:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:33:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:33:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:33:25,904 INFO L87 Difference]: Start difference. First operand 3484 states and 5048 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 02:33:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:33:30,819 INFO L93 Difference]: Finished difference Result 10244 states and 14936 transitions. [2022-07-23 02:33:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:33:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 73 [2022-07-23 02:33:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:33:30,884 INFO L225 Difference]: With dead ends: 10244 [2022-07-23 02:33:30,885 INFO L226 Difference]: Without dead ends: 6773 [2022-07-23 02:33:30,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 02:33:30,911 INFO L413 NwaCegarLoop]: 2806 mSDtfsCounter, 2768 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 1959 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3266 SdHoareTripleChecker+Valid, 4795 SdHoareTripleChecker+Invalid, 4511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1959 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-23 02:33:30,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3266 Valid, 4795 Invalid, 4511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1959 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-23 02:33:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2022-07-23 02:33:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6480. [2022-07-23 02:33:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6480 states, 4124 states have (on average 1.2839476236663434) internal successors, (5295), 4310 states have internal predecessors, (5295), 2060 states have call successors, (2060), 294 states have call predecessors, (2060), 293 states have return successors, (2079), 1983 states have call predecessors, (2079), 2057 states have call successors, (2079) [2022-07-23 02:33:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 9434 transitions. [2022-07-23 02:33:31,360 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 9434 transitions. Word has length 73 [2022-07-23 02:33:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:33:31,363 INFO L495 AbstractCegarLoop]: Abstraction has 6480 states and 9434 transitions. [2022-07-23 02:33:31,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 02:33:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 9434 transitions. [2022-07-23 02:33:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 02:33:31,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:33:31,369 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2022-07-23 02:33:31,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 02:33:31,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:33:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:33:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash -552311738, now seen corresponding path program 1 times [2022-07-23 02:33:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:33:31,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541154177] [2022-07-23 02:33:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:33:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:33:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:33:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:33:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:33:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:33:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:33:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 02:33:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 02:33:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:33:31,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541154177] [2022-07-23 02:33:31,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541154177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:33:31,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:33:31,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:33:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920637135] [2022-07-23 02:33:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:33:31,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:33:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:33:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:33:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:33:31,669 INFO L87 Difference]: Start difference. First operand 6480 states and 9434 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 02:33:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:33:36,495 INFO L93 Difference]: Finished difference Result 19266 states and 28132 transitions. [2022-07-23 02:33:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:33:36,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-07-23 02:33:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:33:36,588 INFO L225 Difference]: With dead ends: 19266 [2022-07-23 02:33:36,589 INFO L226 Difference]: Without dead ends: 12799 [2022-07-23 02:33:36,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 02:33:36,621 INFO L413 NwaCegarLoop]: 2473 mSDtfsCounter, 3080 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 2116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3588 SdHoareTripleChecker+Valid, 4353 SdHoareTripleChecker+Invalid, 4716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2116 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-23 02:33:36,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3588 Valid, 4353 Invalid, 4716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2116 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-23 02:33:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12799 states. [2022-07-23 02:33:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12799 to 12258. [2022-07-23 02:33:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12258 states, 7780 states have (on average 1.2816195372750643) internal successors, (9971), 8136 states have internal predecessors, (9971), 3906 states have call successors, (3906), 572 states have call predecessors, (3906), 569 states have return successors, (3949), 3753 states have call predecessors, (3949), 3903 states have call successors, (3949) [2022-07-23 02:33:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 17826 transitions. [2022-07-23 02:33:37,451 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 17826 transitions. Word has length 76 [2022-07-23 02:33:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:33:37,452 INFO L495 AbstractCegarLoop]: Abstraction has 12258 states and 17826 transitions. [2022-07-23 02:33:37,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 02:33:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 17826 transitions. [2022-07-23 02:33:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-23 02:33:37,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:33:37,456 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2022-07-23 02:33:37,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 02:33:37,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:33:37,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:33:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1165706419, now seen corresponding path program 1 times [2022-07-23 02:33:37,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:33:37,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314133729] [2022-07-23 02:33:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:33:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:33:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:33:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:33:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:33:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:33:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:33:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 02:33:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 02:33:37,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:33:37,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314133729] [2022-07-23 02:33:37,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314133729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:33:37,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:33:37,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:33:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744969235] [2022-07-23 02:33:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:33:37,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:33:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:33:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:33:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:33:37,754 INFO L87 Difference]: Start difference. First operand 12258 states and 17826 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 02:33:42,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:33:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:33:43,879 INFO L93 Difference]: Finished difference Result 21372 states and 31042 transitions. [2022-07-23 02:33:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:33:43,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 79 [2022-07-23 02:33:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:33:43,938 INFO L225 Difference]: With dead ends: 21372 [2022-07-23 02:33:43,938 INFO L226 Difference]: Without dead ends: 9127 [2022-07-23 02:33:43,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 02:33:43,985 INFO L413 NwaCegarLoop]: 3133 mSDtfsCounter, 1944 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1332 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 5143 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1332 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-23 02:33:43,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 5143 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1332 Valid, 2492 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-23 02:33:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2022-07-23 02:33:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 8658. [2022-07-23 02:33:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8658 states, 5547 states have (on average 1.2714981070849107) internal successors, (7053), 5799 states have internal predecessors, (7053), 2669 states have call successors, (2669), 441 states have call predecessors, (2669), 439 states have return successors, (2689), 2560 states have call predecessors, (2689), 2666 states have call successors, (2689) [2022-07-23 02:33:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8658 states to 8658 states and 12411 transitions. [2022-07-23 02:33:44,469 INFO L78 Accepts]: Start accepts. Automaton has 8658 states and 12411 transitions. Word has length 79 [2022-07-23 02:33:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:33:44,470 INFO L495 AbstractCegarLoop]: Abstraction has 8658 states and 12411 transitions. [2022-07-23 02:33:44,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-23 02:33:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 12411 transitions. [2022-07-23 02:33:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 02:33:44,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:33:44,477 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-23 02:33:44,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 02:33:44,477 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:33:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:33:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash 702077142, now seen corresponding path program 1 times [2022-07-23 02:33:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:33:44,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194889022] [2022-07-23 02:33:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:33:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:33:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:33:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:33:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:33:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:33:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:33:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:33:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 02:33:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 02:33:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 02:33:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:33:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-23 02:33:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:33:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194889022] [2022-07-23 02:33:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194889022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:33:44,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:33:44,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:33:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354501972] [2022-07-23 02:33:44,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:33:44,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:33:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:33:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:33:44,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:33:44,733 INFO L87 Difference]: Start difference. First operand 8658 states and 12411 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 02:33:49,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:33:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:33:50,053 INFO L93 Difference]: Finished difference Result 17703 states and 25466 transitions. [2022-07-23 02:33:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 02:33:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2022-07-23 02:33:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:33:50,107 INFO L225 Difference]: With dead ends: 17703 [2022-07-23 02:33:50,108 INFO L226 Difference]: Without dead ends: 9099 [2022-07-23 02:33:50,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:33:50,143 INFO L413 NwaCegarLoop]: 2279 mSDtfsCounter, 768 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 582 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-23 02:33:50,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 4186 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2055 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-07-23 02:33:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2022-07-23 02:33:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 8658. [2022-07-23 02:33:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8658 states, 5547 states have (on average 1.2700558860645395) internal successors, (7045), 5799 states have internal predecessors, (7045), 2669 states have call successors, (2669), 441 states have call predecessors, (2669), 439 states have return successors, (2689), 2560 states have call predecessors, (2689), 2666 states have call successors, (2689) [2022-07-23 02:33:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8658 states to 8658 states and 12403 transitions. [2022-07-23 02:33:50,704 INFO L78 Accepts]: Start accepts. Automaton has 8658 states and 12403 transitions. Word has length 107 [2022-07-23 02:33:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:33:50,706 INFO L495 AbstractCegarLoop]: Abstraction has 8658 states and 12403 transitions. [2022-07-23 02:33:50,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 02:33:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 12403 transitions. [2022-07-23 02:33:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-23 02:33:50,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:33:50,709 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:33:50,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 02:33:50,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:33:50,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:33:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash -288027847, now seen corresponding path program 1 times [2022-07-23 02:33:50,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:33:50,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793771531] [2022-07-23 02:33:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:33:50,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:33:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:33:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:33:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:33:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:33:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:33:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:33:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:33:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:33:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:33:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:33:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:33:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:33:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-23 02:33:50,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:33:50,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793771531] [2022-07-23 02:33:50,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793771531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:33:50,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:33:50,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:33:50,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403804717] [2022-07-23 02:33:50,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:33:50,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:33:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:33:50,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:33:50,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:33:50,962 INFO L87 Difference]: Start difference. First operand 8658 states and 12403 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-23 02:33:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:33:57,049 INFO L93 Difference]: Finished difference Result 26375 states and 38008 transitions. [2022-07-23 02:33:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:33:57,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2022-07-23 02:33:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:33:57,151 INFO L225 Difference]: With dead ends: 26375 [2022-07-23 02:33:57,152 INFO L226 Difference]: Without dead ends: 17771 [2022-07-23 02:33:57,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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 02:33:57,189 INFO L413 NwaCegarLoop]: 2622 mSDtfsCounter, 3212 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3750 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-23 02:33:57,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3750 Valid, 4585 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2123 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-23 02:33:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17771 states. [2022-07-23 02:33:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17771 to 16867. [2022-07-23 02:33:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16867 states, 10788 states have (on average 1.2728958101594363) internal successors, (13732), 11270 states have internal predecessors, (13732), 5223 states have call successors, (5223), 856 states have call predecessors, (5223), 853 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-23 02:33:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 24221 transitions. [2022-07-23 02:33:58,117 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 24221 transitions. Word has length 123 [2022-07-23 02:33:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:33:58,119 INFO L495 AbstractCegarLoop]: Abstraction has 16867 states and 24221 transitions. [2022-07-23 02:33:58,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-23 02:33:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 24221 transitions. [2022-07-23 02:33:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-23 02:33:58,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:33:58,121 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:33:58,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 02:33:58,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:33:58,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:33:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash 134673979, now seen corresponding path program 1 times [2022-07-23 02:33:58,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:33:58,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065935054] [2022-07-23 02:33:58,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:33:58,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:33:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:33:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:33:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:33:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:33:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:33:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:33:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:33:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:33:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:33:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:33:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:33:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:33:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:33:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:33:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-23 02:33:58,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:33:58,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065935054] [2022-07-23 02:33:58,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065935054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:33:58,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:33:58,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:33:58,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064553225] [2022-07-23 02:33:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:33:58,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:33:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:33:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:33:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:33:58,432 INFO L87 Difference]: Start difference. First operand 16867 states and 24221 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 02:34:04,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:34:06,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:34:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:34:07,785 INFO L93 Difference]: Finished difference Result 17755 states and 25634 transitions. [2022-07-23 02:34:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:34:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2022-07-23 02:34:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:34:07,893 INFO L225 Difference]: With dead ends: 17755 [2022-07-23 02:34:07,893 INFO L226 Difference]: Without dead ends: 17753 [2022-07-23 02:34:07,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:34:07,916 INFO L413 NwaCegarLoop]: 2266 mSDtfsCounter, 2529 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 1584 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2742 SdHoareTripleChecker+Valid, 5339 SdHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1584 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-23 02:34:07,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2742 Valid, 5339 Invalid, 5116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1584 Valid, 3530 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2022-07-23 02:34:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17753 states. [2022-07-23 02:34:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17753 to 16871. [2022-07-23 02:34:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16871 states, 10791 states have (on average 1.272819942544713) internal successors, (13735), 11273 states have internal predecessors, (13735), 5223 states have call successors, (5223), 857 states have call predecessors, (5223), 854 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-23 02:34:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16871 states to 16871 states and 24224 transitions. [2022-07-23 02:34:08,905 INFO L78 Accepts]: Start accepts. Automaton has 16871 states and 24224 transitions. Word has length 123 [2022-07-23 02:34:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:34:08,907 INFO L495 AbstractCegarLoop]: Abstraction has 16871 states and 24224 transitions. [2022-07-23 02:34:08,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 02:34:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 16871 states and 24224 transitions. [2022-07-23 02:34:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-23 02:34:08,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:34:08,911 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:34:08,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 02:34:08,912 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:34:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:34:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash 119085821, now seen corresponding path program 1 times [2022-07-23 02:34:08,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:34:08,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357129621] [2022-07-23 02:34:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:34:08,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:34:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:34:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:34:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:34:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:34:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:34:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:34:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:34:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:34:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:34:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:34:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:34:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:34:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 02:34:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-23 02:34:09,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:34:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357129621] [2022-07-23 02:34:09,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357129621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:34:09,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:34:09,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:34:09,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223849514] [2022-07-23 02:34:09,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:34:09,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:34:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:34:09,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:34:09,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:34:09,221 INFO L87 Difference]: Start difference. First operand 16871 states and 24224 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, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 02:34:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:34:14,131 INFO L93 Difference]: Finished difference Result 17759 states and 25637 transitions. [2022-07-23 02:34:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:34:14,131 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, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2022-07-23 02:34:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:34:14,246 INFO L225 Difference]: With dead ends: 17759 [2022-07-23 02:34:14,246 INFO L226 Difference]: Without dead ends: 17757 [2022-07-23 02:34:14,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:34:14,268 INFO L413 NwaCegarLoop]: 2269 mSDtfsCounter, 2521 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 1583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 5115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1583 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-23 02:34:14,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5342 Invalid, 5115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1583 Valid, 3532 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-23 02:34:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17757 states. [2022-07-23 02:34:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17757 to 16875. [2022-07-23 02:34:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16875 states, 10794 states have (on average 1.2727441171020937) internal successors, (13738), 11276 states have internal predecessors, (13738), 5223 states have call successors, (5223), 858 states have call predecessors, (5223), 855 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-23 02:34:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16875 states to 16875 states and 24227 transitions. [2022-07-23 02:34:15,190 INFO L78 Accepts]: Start accepts. Automaton has 16875 states and 24227 transitions. Word has length 128 [2022-07-23 02:34:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:34:15,191 INFO L495 AbstractCegarLoop]: Abstraction has 16875 states and 24227 transitions. [2022-07-23 02:34:15,191 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, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 02:34:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 16875 states and 24227 transitions. [2022-07-23 02:34:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-23 02:34:15,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:34:15,194 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2022-07-23 02:34:15,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 02:34:15,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:34:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:34:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1558624059, now seen corresponding path program 1 times [2022-07-23 02:34:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:34:15,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077044942] [2022-07-23 02:34:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:34:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:34:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:34:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:34:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:34:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:34:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:34:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:34:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:34:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:34:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:34:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:34:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:34:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:34:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 02:34:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:34:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-23 02:34:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:34:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077044942] [2022-07-23 02:34:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077044942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:34:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:34:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:34:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167720913] [2022-07-23 02:34:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:34:15,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:34:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:34:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:34:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:34:15,454 INFO L87 Difference]: Start difference. First operand 16875 states and 24227 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, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 02:34:21,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:34:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:34:22,695 INFO L93 Difference]: Finished difference Result 17763 states and 25640 transitions. [2022-07-23 02:34:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:34:22,696 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, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2022-07-23 02:34:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:34:22,802 INFO L225 Difference]: With dead ends: 17763 [2022-07-23 02:34:22,802 INFO L226 Difference]: Without dead ends: 17761 [2022-07-23 02:34:22,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:34:22,822 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2521 mSDsluCounter, 3076 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 1582 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 5346 SdHoareTripleChecker+Invalid, 5114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1582 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-23 02:34:22,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 5346 Invalid, 5114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1582 Valid, 3531 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-07-23 02:34:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17761 states. [2022-07-23 02:34:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17761 to 16879. [2022-07-23 02:34:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16879 states, 10797 states have (on average 1.2726683337964249) internal successors, (13741), 11279 states have internal predecessors, (13741), 5223 states have call successors, (5223), 859 states have call predecessors, (5223), 856 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-23 02:34:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16879 states to 16879 states and 24230 transitions. [2022-07-23 02:34:23,697 INFO L78 Accepts]: Start accepts. Automaton has 16879 states and 24230 transitions. Word has length 133 [2022-07-23 02:34:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:34:23,698 INFO L495 AbstractCegarLoop]: Abstraction has 16879 states and 24230 transitions. [2022-07-23 02:34:23,698 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, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 02:34:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 16879 states and 24230 transitions. [2022-07-23 02:34:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 02:34:23,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:34:23,838 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-23 02:34:23,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 02:34:23,838 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:34:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:34:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1025780093, now seen corresponding path program 1 times [2022-07-23 02:34:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:34:23,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550771225] [2022-07-23 02:34:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:34:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:34:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:34:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:23,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:34:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:23,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:34:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:34:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:34:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:34:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:34:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:34:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:34:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:34:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:34:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:34:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 02:34:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:34:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 02:34:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-23 02:34:24,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:34:24,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550771225] [2022-07-23 02:34:24,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550771225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:34:24,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:34:24,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:34:24,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974353795] [2022-07-23 02:34:24,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:34:24,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:34:24,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:34:24,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:34:24,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:34:24,079 INFO L87 Difference]: Start difference. First operand 16879 states and 24230 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, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 02:34:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:34:29,161 INFO L93 Difference]: Finished difference Result 17767 states and 25643 transitions. [2022-07-23 02:34:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:34:29,162 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, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2022-07-23 02:34:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:34:29,250 INFO L225 Difference]: With dead ends: 17767 [2022-07-23 02:34:29,250 INFO L226 Difference]: Without dead ends: 17765 [2022-07-23 02:34:29,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:34:29,269 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2520 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 1579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5344 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1579 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-23 02:34:29,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5344 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1579 Valid, 3532 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-23 02:34:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17765 states. [2022-07-23 02:34:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17765 to 16883. [2022-07-23 02:34:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16883 states, 10800 states have (on average 1.2725925925925925) internal successors, (13744), 11282 states have internal predecessors, (13744), 5223 states have call successors, (5223), 860 states have call predecessors, (5223), 857 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-23 02:34:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16883 states to 16883 states and 24233 transitions. [2022-07-23 02:34:30,142 INFO L78 Accepts]: Start accepts. Automaton has 16883 states and 24233 transitions. Word has length 138 [2022-07-23 02:34:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:34:30,142 INFO L495 AbstractCegarLoop]: Abstraction has 16883 states and 24233 transitions. [2022-07-23 02:34:30,143 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, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 02:34:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 16883 states and 24233 transitions. [2022-07-23 02:34:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-23 02:34:30,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:34:30,146 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:34:30,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 02:34:30,146 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:34:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:34:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1519618408, now seen corresponding path program 1 times [2022-07-23 02:34:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:34:30,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365226574] [2022-07-23 02:34:30,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:34:30,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:34:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:34:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:34:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:34:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:34:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:34:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:34:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:34:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:34:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 02:34:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 02:34:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 02:34:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:34:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 02:34:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-23 02:34:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:34:30,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365226574] [2022-07-23 02:34:30,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365226574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:34:30,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:34:30,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:34:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740044980] [2022-07-23 02:34:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:34:30,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:34:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:34:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:34:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:34:30,334 INFO L87 Difference]: Start difference. First operand 16883 states and 24233 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-23 02:34:35,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:34:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:34:37,677 INFO L93 Difference]: Finished difference Result 39594 states and 56950 transitions. [2022-07-23 02:34:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:34:37,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 142 [2022-07-23 02:34:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:34:37,788 INFO L225 Difference]: With dead ends: 39594 [2022-07-23 02:34:37,789 INFO L226 Difference]: Without dead ends: 22765 [2022-07-23 02:34:37,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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 02:34:37,869 INFO L413 NwaCegarLoop]: 3521 mSDtfsCounter, 1803 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 1242 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 5759 SdHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1242 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-23 02:34:37,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2259 Valid, 5759 Invalid, 3734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1242 Valid, 2491 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-23 02:34:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22765 states. [2022-07-23 02:34:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22765 to 21461. [2022-07-23 02:34:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21461 states, 13760 states have (on average 1.26875) internal successors, (17458), 14368 states have internal predecessors, (17458), 6559 states have call successors, (6559), 1142 states have call predecessors, (6559), 1139 states have return successors, (6602), 6318 states have call predecessors, (6602), 6556 states have call successors, (6602) [2022-07-23 02:34:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21461 states to 21461 states and 30619 transitions. [2022-07-23 02:34:38,931 INFO L78 Accepts]: Start accepts. Automaton has 21461 states and 30619 transitions. Word has length 142 [2022-07-23 02:34:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:34:38,934 INFO L495 AbstractCegarLoop]: Abstraction has 21461 states and 30619 transitions. [2022-07-23 02:34:38,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-23 02:34:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 21461 states and 30619 transitions. [2022-07-23 02:34:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-23 02:34:38,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:34:38,937 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:34:38,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 02:34:38,938 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:34:38,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:34:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -197466053, now seen corresponding path program 1 times [2022-07-23 02:34:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:34:38,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391949618] [2022-07-23 02:34:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:34:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:34:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:34:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:34:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:34:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:34:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:34:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:34:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:34:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:34:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:34:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:34:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:34:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:34:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 02:34:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:34:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 02:34:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 02:34:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-07-23 02:34:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:34:39,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391949618] [2022-07-23 02:34:39,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391949618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:34:39,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:34:39,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:34:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650986484] [2022-07-23 02:34:39,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:34:39,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:34:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:34:39,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:34:39,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:34:39,188 INFO L87 Difference]: Start difference. First operand 21461 states and 30619 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, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 02:34:45,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:34:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:34:46,400 INFO L93 Difference]: Finished difference Result 22727 states and 32616 transitions. [2022-07-23 02:34:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:34:46,401 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, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2022-07-23 02:34:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:34:46,497 INFO L225 Difference]: With dead ends: 22727 [2022-07-23 02:34:46,497 INFO L226 Difference]: Without dead ends: 22725 [2022-07-23 02:34:46,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:34:46,512 INFO L413 NwaCegarLoop]: 2269 mSDtfsCounter, 2521 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 1580 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 5112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1580 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-23 02:34:46,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5342 Invalid, 5112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1580 Valid, 3531 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-23 02:34:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22725 states. [2022-07-23 02:34:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22725 to 21465. [2022-07-23 02:34:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21465 states, 13763 states have (on average 1.2686914190220155) internal successors, (17461), 14371 states have internal predecessors, (17461), 6559 states have call successors, (6559), 1143 states have call predecessors, (6559), 1140 states have return successors, (6602), 6318 states have call predecessors, (6602), 6556 states have call successors, (6602) [2022-07-23 02:34:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21465 states to 21465 states and 30622 transitions. [2022-07-23 02:34:47,509 INFO L78 Accepts]: Start accepts. Automaton has 21465 states and 30622 transitions. Word has length 143 [2022-07-23 02:34:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:34:47,510 INFO L495 AbstractCegarLoop]: Abstraction has 21465 states and 30622 transitions. [2022-07-23 02:34:47,510 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, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 02:34:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21465 states and 30622 transitions. [2022-07-23 02:34:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-23 02:34:47,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:34:47,513 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:34:47,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 02:34:47,513 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:34:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:34:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1861665026, now seen corresponding path program 1 times [2022-07-23 02:34:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:34:47,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666770594] [2022-07-23 02:34:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:34:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:34:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:34:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:34:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:34:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:34:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:34:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:34:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:34:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:34:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:34:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:34:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:34:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:34:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 02:34:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:34:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:34:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 02:34:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 02:34:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 02:34:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 02:34:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-23 02:34:47,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:34:47,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666770594] [2022-07-23 02:34:47,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666770594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:34:47,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:34:47,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:34:47,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392892707] [2022-07-23 02:34:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:34:47,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:34:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:34:47,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:34:47,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:34:47,950 INFO L87 Difference]: Start difference. First operand 21465 states and 30622 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 02:34:53,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:34:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:34:55,061 INFO L93 Difference]: Finished difference Result 22731 states and 32619 transitions. [2022-07-23 02:34:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:34:55,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 166 [2022-07-23 02:34:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:34:55,155 INFO L225 Difference]: With dead ends: 22731 [2022-07-23 02:34:55,156 INFO L226 Difference]: Without dead ends: 22729 [2022-07-23 02:34:55,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:34:55,174 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 2511 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 1577 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2722 SdHoareTripleChecker+Valid, 5348 SdHoareTripleChecker+Invalid, 5109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1577 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-23 02:34:55,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2722 Valid, 5348 Invalid, 5109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1577 Valid, 3531 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-23 02:34:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22729 states. [2022-07-23 02:34:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22729 to 21469. [2022-07-23 02:34:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21469 states, 13766 states have (on average 1.2686328635769286) internal successors, (17464), 14374 states have internal predecessors, (17464), 6559 states have call successors, (6559), 1144 states have call predecessors, (6559), 1141 states have return successors, (6602), 6318 states have call predecessors, (6602), 6556 states have call successors, (6602) [2022-07-23 02:34:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21469 states to 21469 states and 30625 transitions. [2022-07-23 02:34:56,189 INFO L78 Accepts]: Start accepts. Automaton has 21469 states and 30625 transitions. Word has length 166 [2022-07-23 02:34:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:34:56,190 INFO L495 AbstractCegarLoop]: Abstraction has 21469 states and 30625 transitions. [2022-07-23 02:34:56,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 02:34:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 21469 states and 30625 transitions. [2022-07-23 02:34:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-23 02:34:56,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:34:56,192 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:34:56,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 02:34:56,193 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:34:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:34:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1530366267, now seen corresponding path program 1 times [2022-07-23 02:34:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:34:56,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895077318] [2022-07-23 02:34:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:34:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:34:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:34:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:34:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:34:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:34:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:34:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:34:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:34:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:34:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:34:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:34:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:34:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:34:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:34:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 02:34:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:34:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 02:34:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 02:34:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 02:34:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 02:34:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:34:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-23 02:34:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:34:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895077318] [2022-07-23 02:34:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895077318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:34:56,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:34:56,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:34:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079051116] [2022-07-23 02:34:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:34:56,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:34:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:34:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:34:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:34:56,459 INFO L87 Difference]: Start difference. First operand 21469 states and 30625 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, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 02:35:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:35:04,753 INFO L93 Difference]: Finished difference Result 26901 states and 38530 transitions. [2022-07-23 02:35:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 02:35:04,755 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, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2022-07-23 02:35:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:35:04,882 INFO L225 Difference]: With dead ends: 26901 [2022-07-23 02:35:04,882 INFO L226 Difference]: Without dead ends: 26899 [2022-07-23 02:35:04,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:35:04,905 INFO L413 NwaCegarLoop]: 2530 mSDtfsCounter, 2114 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 4874 mSolverCounterSat, 1445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2355 SdHoareTripleChecker+Valid, 5986 SdHoareTripleChecker+Invalid, 6319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1445 IncrementalHoareTripleChecker+Valid, 4874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-23 02:35:04,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2355 Valid, 5986 Invalid, 6319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1445 Valid, 4874 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-23 02:35:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26899 states. [2022-07-23 02:35:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26899 to 25623. [2022-07-23 02:35:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25623 states, 16373 states have (on average 1.2737433579673854) internal successors, (20855), 17093 states have internal predecessors, (20855), 7815 states have call successors, (7815), 1435 states have call predecessors, (7815), 1432 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-23 02:35:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25623 states to 25623 states and 36528 transitions. [2022-07-23 02:35:06,082 INFO L78 Accepts]: Start accepts. Automaton has 25623 states and 36528 transitions. Word has length 153 [2022-07-23 02:35:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:35:06,083 INFO L495 AbstractCegarLoop]: Abstraction has 25623 states and 36528 transitions. [2022-07-23 02:35:06,083 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, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 02:35:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 25623 states and 36528 transitions. [2022-07-23 02:35:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-23 02:35:06,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:35:06,086 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:35:06,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 02:35:06,086 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:35:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:35:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 184219261, now seen corresponding path program 1 times [2022-07-23 02:35:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:35:06,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743391130] [2022-07-23 02:35:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:35:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:35:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:35:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:35:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:35:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:35:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:35:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:35:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:35:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:35:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:35:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:35:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:35:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:35:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 02:35:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:35:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 02:35:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 02:35:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 02:35:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 02:35:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 02:35:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-07-23 02:35:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:35:06,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743391130] [2022-07-23 02:35:06,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743391130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:35:06,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:35:06,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:35:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87435390] [2022-07-23 02:35:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:35:06,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:35:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:35:06,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:35:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:35:06,365 INFO L87 Difference]: Start difference. First operand 25623 states and 36528 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, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 02:35:13,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:35:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:35:15,440 INFO L93 Difference]: Finished difference Result 26905 states and 38533 transitions. [2022-07-23 02:35:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:35:15,441 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, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2022-07-23 02:35:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:35:15,588 INFO L225 Difference]: With dead ends: 26905 [2022-07-23 02:35:15,588 INFO L226 Difference]: Without dead ends: 26903 [2022-07-23 02:35:15,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:35:15,606 INFO L413 NwaCegarLoop]: 2273 mSDtfsCounter, 2520 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1574 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2732 SdHoareTripleChecker+Valid, 5355 SdHoareTripleChecker+Invalid, 5103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1574 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-23 02:35:15,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2732 Valid, 5355 Invalid, 5103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1574 Valid, 3528 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2022-07-23 02:35:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26903 states. [2022-07-23 02:35:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26903 to 25627. [2022-07-23 02:35:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25627 states, 16376 states have (on average 1.2736932095749878) internal successors, (20858), 17096 states have internal predecessors, (20858), 7815 states have call successors, (7815), 1436 states have call predecessors, (7815), 1433 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-23 02:35:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25627 states to 25627 states and 36531 transitions. [2022-07-23 02:35:16,905 INFO L78 Accepts]: Start accepts. Automaton has 25627 states and 36531 transitions. Word has length 158 [2022-07-23 02:35:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:35:16,906 INFO L495 AbstractCegarLoop]: Abstraction has 25627 states and 36531 transitions. [2022-07-23 02:35:16,906 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, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 02:35:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 25627 states and 36531 transitions. [2022-07-23 02:35:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-23 02:35:16,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:35:16,909 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:35:16,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 02:35:16,910 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:35:16,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:35:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1461900950, now seen corresponding path program 1 times [2022-07-23 02:35:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:35:16,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158674067] [2022-07-23 02:35:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:35:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:35:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:35:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:35:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:35:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:35:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:35:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:35:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:35:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:35:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:35:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:35:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:35:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:35:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 02:35:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:35:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:35:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 02:35:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 02:35:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 02:35:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 02:35:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 02:35:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 02:35:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-23 02:35:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-23 02:35:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:35:17,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158674067] [2022-07-23 02:35:17,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158674067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:35:17,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:35:17,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:35:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583717501] [2022-07-23 02:35:17,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:35:17,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:35:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:35:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:35:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:35:17,248 INFO L87 Difference]: Start difference. First operand 25627 states and 36531 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 02:35:24,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:35:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:35:25,857 INFO L93 Difference]: Finished difference Result 26909 states and 38536 transitions. [2022-07-23 02:35:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:35:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 181 [2022-07-23 02:35:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:35:25,954 INFO L225 Difference]: With dead ends: 26909 [2022-07-23 02:35:25,954 INFO L226 Difference]: Without dead ends: 26907 [2022-07-23 02:35:25,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:35:25,969 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 2513 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1573 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2723 SdHoareTripleChecker+Valid, 5349 SdHoareTripleChecker+Invalid, 5102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1573 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-23 02:35:25,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2723 Valid, 5349 Invalid, 5102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1573 Valid, 3528 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-07-23 02:35:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26907 states. [2022-07-23 02:35:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26907 to 25631. [2022-07-23 02:35:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25631 states, 16379 states have (on average 1.2736430795530862) internal successors, (20861), 17099 states have internal predecessors, (20861), 7815 states have call successors, (7815), 1437 states have call predecessors, (7815), 1434 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-23 02:35:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25631 states to 25631 states and 36534 transitions. [2022-07-23 02:35:27,055 INFO L78 Accepts]: Start accepts. Automaton has 25631 states and 36534 transitions. Word has length 181 [2022-07-23 02:35:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:35:27,056 INFO L495 AbstractCegarLoop]: Abstraction has 25631 states and 36534 transitions. [2022-07-23 02:35:27,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 02:35:27,056 INFO L276 IsEmpty]: Start isEmpty. Operand 25631 states and 36534 transitions. [2022-07-23 02:35:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-23 02:35:27,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:35:27,058 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:35:27,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 02:35:27,059 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:35:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:35:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash 442414333, now seen corresponding path program 1 times [2022-07-23 02:35:27,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:35:27,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224551449] [2022-07-23 02:35:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:35:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:35:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:35:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:35:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:35:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:35:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:35:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:35:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:35:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:35:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:35:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:35:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:35:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 02:35:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 02:35:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:35:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 02:35:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 02:35:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 02:35:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 02:35:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 02:35:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 02:35:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 02:35:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-07-23 02:35:27,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:35:27,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224551449] [2022-07-23 02:35:27,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224551449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:35:27,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:35:27,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:35:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258094839] [2022-07-23 02:35:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:35:27,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:35:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:35:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:35:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:35:27,329 INFO L87 Difference]: Start difference. First operand 25631 states and 36534 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 02:35:33,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:35:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:35:35,339 INFO L93 Difference]: Finished difference Result 26913 states and 38539 transitions. [2022-07-23 02:35:35,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:35:35,340 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 168 [2022-07-23 02:35:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:35:35,466 INFO L225 Difference]: With dead ends: 26913 [2022-07-23 02:35:35,466 INFO L226 Difference]: Without dead ends: 26911 [2022-07-23 02:35:35,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:35:35,487 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2522 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1572 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2735 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 5101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1572 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-23 02:35:35,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2735 Valid, 5345 Invalid, 5101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1572 Valid, 3528 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-07-23 02:35:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26911 states. [2022-07-23 02:35:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26911 to 25635. [2022-07-23 02:35:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25635 states, 16382 states have (on average 1.2735929678915883) internal successors, (20864), 17102 states have internal predecessors, (20864), 7815 states have call successors, (7815), 1438 states have call predecessors, (7815), 1435 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-23 02:35:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25635 states to 25635 states and 36537 transitions. [2022-07-23 02:35:36,659 INFO L78 Accepts]: Start accepts. Automaton has 25635 states and 36537 transitions. Word has length 168 [2022-07-23 02:35:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:35:36,660 INFO L495 AbstractCegarLoop]: Abstraction has 25635 states and 36537 transitions. [2022-07-23 02:35:36,660 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 02:35:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 25635 states and 36537 transitions. [2022-07-23 02:35:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-23 02:35:36,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:35:36,663 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:35:36,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 02:35:36,663 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:35:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:35:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1505550806, now seen corresponding path program 1 times [2022-07-23 02:35:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:35:36,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467057922] [2022-07-23 02:35:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:35:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:35:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:35:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:35:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:35:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:35:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:35:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:35:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:35:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:35:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:35:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:35:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:35:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:35:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 02:35:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:35:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:35:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 02:35:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 02:35:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 02:35:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 02:35:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 02:35:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 02:35:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-23 02:35:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 02:35:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-23 02:35:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-07-23 02:35:36,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:35:36,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467057922] [2022-07-23 02:35:36,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467057922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:35:36,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:35:36,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:35:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417903623] [2022-07-23 02:35:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:35:36,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:35:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:35:36,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:35:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:35:36,934 INFO L87 Difference]: Start difference. First operand 25635 states and 36537 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 02:35:43,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:35:45,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:35:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:35:46,973 INFO L93 Difference]: Finished difference Result 26917 states and 38542 transitions. [2022-07-23 02:35:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:35:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 191 [2022-07-23 02:35:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:35:47,080 INFO L225 Difference]: With dead ends: 26917 [2022-07-23 02:35:47,080 INFO L226 Difference]: Without dead ends: 26913 [2022-07-23 02:35:47,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:35:47,098 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2513 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 1571 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 5100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1571 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-23 02:35:47,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 5345 Invalid, 5100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1571 Valid, 3527 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2022-07-23 02:35:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26913 states. [2022-07-23 02:35:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26913 to 25637. [2022-07-23 02:35:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25637 states, 16384 states have (on average 1.27349853515625) internal successors, (20865), 17103 states have internal predecessors, (20865), 7815 states have call successors, (7815), 1439 states have call predecessors, (7815), 1435 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-23 02:35:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25637 states to 25637 states and 36538 transitions. [2022-07-23 02:35:48,341 INFO L78 Accepts]: Start accepts. Automaton has 25637 states and 36538 transitions. Word has length 191 [2022-07-23 02:35:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:35:48,341 INFO L495 AbstractCegarLoop]: Abstraction has 25637 states and 36538 transitions. [2022-07-23 02:35:48,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-23 02:35:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25637 states and 36538 transitions. [2022-07-23 02:35:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-23 02:35:48,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:35:48,343 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-07-23 02:35:48,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 02:35:48,343 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:35:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:35:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1962924606, now seen corresponding path program 1 times [2022-07-23 02:35:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:35:48,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995554190] [2022-07-23 02:35:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:35:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:35:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:35:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:35:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:35:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:35:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:35:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:35:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:35:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:35:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:35:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 02:35:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 02:35:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:35:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 02:35:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 02:35:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:35:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 02:35:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 02:35:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 02:35:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 02:35:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 02:35:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 02:35:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-23 02:35:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 02:35:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-23 02:35:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 02:35:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-07-23 02:35:48,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:35:48,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995554190] [2022-07-23 02:35:48,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995554190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:35:48,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:35:48,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:35:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514309162] [2022-07-23 02:35:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:35:48,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:35:48,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:35:48,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:35:48,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:35:48,639 INFO L87 Difference]: Start difference. First operand 25637 states and 36538 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 02:35:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:35:54,277 INFO L93 Difference]: Finished difference Result 26913 states and 38538 transitions. [2022-07-23 02:35:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:35:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 196 [2022-07-23 02:35:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:35:54,373 INFO L225 Difference]: With dead ends: 26913 [2022-07-23 02:35:54,373 INFO L226 Difference]: Without dead ends: 26689 [2022-07-23 02:35:54,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:35:54,392 INFO L413 NwaCegarLoop]: 2269 mSDtfsCounter, 2505 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 3524 mSolverCounterSat, 1570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2716 SdHoareTripleChecker+Valid, 5348 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1570 IncrementalHoareTripleChecker+Valid, 3524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-23 02:35:54,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2716 Valid, 5348 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1570 Valid, 3524 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-23 02:35:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26689 states. [2022-07-23 02:35:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26689 to 25413. [2022-07-23 02:35:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25413 states, 16242 states have (on average 1.2730575052333457) internal successors, (20677), 16937 states have internal predecessors, (20677), 7748 states have call successors, (7748), 1423 states have call predecessors, (7748), 1421 states have return successors, (7794), 7516 states have call predecessors, (7794), 7748 states have call successors, (7794) [2022-07-23 02:35:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25413 states to 25413 states and 36219 transitions. [2022-07-23 02:35:55,704 INFO L78 Accepts]: Start accepts. Automaton has 25413 states and 36219 transitions. Word has length 196 [2022-07-23 02:35:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:35:55,704 INFO L495 AbstractCegarLoop]: Abstraction has 25413 states and 36219 transitions. [2022-07-23 02:35:55,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 02:35:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 25413 states and 36219 transitions. [2022-07-23 02:35:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-23 02:35:55,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:35:55,708 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:35:55,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 02:35:55,709 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:35:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:35:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash -968498435, now seen corresponding path program 1 times [2022-07-23 02:35:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:35:55,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649702127] [2022-07-23 02:35:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:35:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:35:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:35:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:35:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:35:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:35:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:35:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:35:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:35:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:35:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 02:35:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 02:35:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 02:35:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:35:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:35:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:35:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:35:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 02:35:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:35:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:35:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:35:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-23 02:35:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 02:35:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-23 02:35:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:35:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-23 02:35:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:35:55,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649702127] [2022-07-23 02:35:55,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649702127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:35:55,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:35:55,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:35:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672145409] [2022-07-23 02:35:55,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:35:55,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:35:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:35:55,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:35:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:35:55,934 INFO L87 Difference]: Start difference. First operand 25413 states and 36219 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-23 02:36:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:36:02,289 INFO L93 Difference]: Finished difference Result 57921 states and 82741 transitions. [2022-07-23 02:36:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:36:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 216 [2022-07-23 02:36:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:36:02,412 INFO L225 Difference]: With dead ends: 57921 [2022-07-23 02:36:02,412 INFO L226 Difference]: Without dead ends: 32519 [2022-07-23 02:36:02,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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 02:36:02,488 INFO L413 NwaCegarLoop]: 3497 mSDtfsCounter, 1766 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 1158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 5718 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1158 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-23 02:36:02,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 5718 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1158 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-23 02:36:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32519 states. [2022-07-23 02:36:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32519 to 30857. [2022-07-23 02:36:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30857 states, 19737 states have (on average 1.2716724932867203) internal successors, (25099), 20578 states have internal predecessors, (25099), 9353 states have call successors, (9353), 1767 states have call predecessors, (9353), 1765 states have return successors, (9399), 9081 states have call predecessors, (9399), 9353 states have call successors, (9399) [2022-07-23 02:36:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30857 states to 30857 states and 43851 transitions. [2022-07-23 02:36:03,942 INFO L78 Accepts]: Start accepts. Automaton has 30857 states and 43851 transitions. Word has length 216 [2022-07-23 02:36:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:36:03,943 INFO L495 AbstractCegarLoop]: Abstraction has 30857 states and 43851 transitions. [2022-07-23 02:36:03,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-23 02:36:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30857 states and 43851 transitions. [2022-07-23 02:36:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-23 02:36:03,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:36:03,947 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:36:03,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 02:36:03,948 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:36:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:36:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash -693738821, now seen corresponding path program 1 times [2022-07-23 02:36:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:36:03,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213244389] [2022-07-23 02:36:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:36:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:36:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:36:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:36:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:36:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:36:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:36:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:36:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:36:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:36:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 02:36:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 02:36:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 02:36:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:36:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:36:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:36:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:36:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 02:36:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:36:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:36:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-23 02:36:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 02:36:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-23 02:36:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-23 02:36:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:36:04,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213244389] [2022-07-23 02:36:04,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213244389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:36:04,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:36:04,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:36:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546054609] [2022-07-23 02:36:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:36:04,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:36:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:36:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:36:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:36:04,177 INFO L87 Difference]: Start difference. First operand 30857 states and 43851 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-23 02:36:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:36:11,787 INFO L93 Difference]: Finished difference Result 74180 states and 106059 transitions. [2022-07-23 02:36:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:36:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 216 [2022-07-23 02:36:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:36:11,963 INFO L225 Difference]: With dead ends: 74180 [2022-07-23 02:36:11,963 INFO L226 Difference]: Without dead ends: 43377 [2022-07-23 02:36:12,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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 02:36:12,067 INFO L413 NwaCegarLoop]: 3754 mSDtfsCounter, 2337 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 1482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2852 SdHoareTripleChecker+Valid, 5628 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1482 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-23 02:36:12,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2852 Valid, 5628 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1482 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-23 02:36:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43377 states. [2022-07-23 02:36:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43377 to 41217. [2022-07-23 02:36:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41217 states, 26053 states have (on average 1.2714082831151883) internal successors, (33124), 27216 states have internal predecessors, (33124), 12821 states have call successors, (12821), 2343 states have call predecessors, (12821), 2341 states have return successors, (12863), 12437 states have call predecessors, (12863), 12821 states have call successors, (12863) [2022-07-23 02:36:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41217 states to 41217 states and 58808 transitions. [2022-07-23 02:36:14,164 INFO L78 Accepts]: Start accepts. Automaton has 41217 states and 58808 transitions. Word has length 216 [2022-07-23 02:36:14,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:36:14,165 INFO L495 AbstractCegarLoop]: Abstraction has 41217 states and 58808 transitions. [2022-07-23 02:36:14,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-23 02:36:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 41217 states and 58808 transitions. [2022-07-23 02:36:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-23 02:36:14,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:36:14,170 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 02:36:14,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 02:36:14,171 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:36:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:36:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash 499296066, now seen corresponding path program 1 times [2022-07-23 02:36:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:36:14,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828462327] [2022-07-23 02:36:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:36:14,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:36:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:36:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:36:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:36:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:36:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:36:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:36:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:36:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:36:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 02:36:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 02:36:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 02:36:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:36:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:36:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:36:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:36:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 02:36:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:36:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:36:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-23 02:36:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 02:36:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-23 02:36:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-23 02:36:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-23 02:36:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-23 02:36:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-23 02:36:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2022-07-23 02:36:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:36:14,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828462327] [2022-07-23 02:36:14,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828462327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:36:14,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:36:14,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:36:14,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293504123] [2022-07-23 02:36:14,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:36:14,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:36:14,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:36:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:36:14,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:36:14,398 INFO L87 Difference]: Start difference. First operand 41217 states and 58808 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-23 02:36:20,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:36:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:36:24,229 INFO L93 Difference]: Finished difference Result 90386 states and 129255 transitions. [2022-07-23 02:36:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:36:24,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 270 [2022-07-23 02:36:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:36:24,580 INFO L225 Difference]: With dead ends: 90386 [2022-07-23 02:36:24,580 INFO L226 Difference]: Without dead ends: 49237 [2022-07-23 02:36:24,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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 02:36:24,684 INFO L413 NwaCegarLoop]: 3381 mSDtfsCounter, 1773 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 1178 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 5515 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1178 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-23 02:36:24,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 5515 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1178 Valid, 2421 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-07-23 02:36:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49237 states. [2022-07-23 02:36:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49237 to 46699. [2022-07-23 02:36:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46699 states, 29587 states have (on average 1.2706932098556798) internal successors, (37596), 30896 states have internal predecessors, (37596), 14429 states have call successors, (14429), 2683 states have call predecessors, (14429), 2681 states have return successors, (14471), 14005 states have call predecessors, (14471), 14429 states have call successors, (14471) [2022-07-23 02:36:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46699 states to 46699 states and 66496 transitions. [2022-07-23 02:36:27,130 INFO L78 Accepts]: Start accepts. Automaton has 46699 states and 66496 transitions. Word has length 270 [2022-07-23 02:36:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:36:27,131 INFO L495 AbstractCegarLoop]: Abstraction has 46699 states and 66496 transitions. [2022-07-23 02:36:27,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-23 02:36:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 46699 states and 66496 transitions. [2022-07-23 02:36:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-23 02:36:27,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:36:27,136 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 02:36:27,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 02:36:27,137 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:36:27,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:36:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash 774055680, now seen corresponding path program 1 times [2022-07-23 02:36:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:36:27,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352924064] [2022-07-23 02:36:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:36:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:36:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:36:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:36:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:36:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:36:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:36:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:36:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:36:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:36:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 02:36:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 02:36:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 02:36:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:36:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:36:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:36:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:36:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 02:36:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:36:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:36:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-23 02:36:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 02:36:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-23 02:36:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-23 02:36:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-23 02:36:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-23 02:36:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-23 02:36:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2022-07-23 02:36:27,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:36:27,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352924064] [2022-07-23 02:36:27,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352924064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:36:27,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:36:27,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:36:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411710585] [2022-07-23 02:36:27,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:36:27,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:36:27,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:36:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:36:27,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:36:27,401 INFO L87 Difference]: Start difference. First operand 46699 states and 66496 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-23 02:36:33,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:36:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:36:37,220 INFO L93 Difference]: Finished difference Result 101824 states and 145335 transitions. [2022-07-23 02:36:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:36:37,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 270 [2022-07-23 02:36:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:36:37,614 INFO L225 Difference]: With dead ends: 101824 [2022-07-23 02:36:37,614 INFO L226 Difference]: Without dead ends: 55193 [2022-07-23 02:36:37,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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 02:36:37,725 INFO L413 NwaCegarLoop]: 3496 mSDtfsCounter, 1787 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 1161 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 5718 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-23 02:36:37,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 5718 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 2424 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-07-23 02:36:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55193 states. [2022-07-23 02:36:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55193 to 52277. [2022-07-23 02:36:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52277 states, 33201 states have (on average 1.2699617481401162) internal successors, (42164), 34656 states have internal predecessors, (42164), 16045 states have call successors, (16045), 3031 states have call predecessors, (16045), 3029 states have return successors, (16087), 15581 states have call predecessors, (16087), 16045 states have call successors, (16087) [2022-07-23 02:36:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52277 states to 52277 states and 74296 transitions. [2022-07-23 02:36:40,267 INFO L78 Accepts]: Start accepts. Automaton has 52277 states and 74296 transitions. Word has length 270 [2022-07-23 02:36:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:36:40,267 INFO L495 AbstractCegarLoop]: Abstraction has 52277 states and 74296 transitions. [2022-07-23 02:36:40,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-23 02:36:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 52277 states and 74296 transitions. [2022-07-23 02:36:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-23 02:36:40,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:36:40,273 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 11, 11, 11, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:36:40,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 02:36:40,273 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:36:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:36:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash 330673094, now seen corresponding path program 1 times [2022-07-23 02:36:40,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:36:40,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880833338] [2022-07-23 02:36:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:36:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:36:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:36:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:36:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:36:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:36:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 02:36:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 02:36:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 02:36:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:36:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 02:36:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 02:36:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 02:36:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 02:36:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 02:36:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:36:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:36:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 02:36:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 02:36:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 02:36:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-23 02:36:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 02:36:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-23 02:36:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-23 02:36:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-23 02:36:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-23 02:36:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 02:36:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-23 02:36:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:36:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-23 02:36:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-23 02:36:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:36:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-07-23 02:36:40,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:36:40,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880833338] [2022-07-23 02:36:40,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880833338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:36:40,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:36:40,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:36:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118299827] [2022-07-23 02:36:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:36:40,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:36:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:36:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:36:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:36:40,887 INFO L87 Difference]: Start difference. First operand 52277 states and 74296 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 02:36:48,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-23 02:36:51,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []