./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 f4b24e32 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-?-f4b24e3 [2022-07-14 02:57:09,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 02:57:09,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 02:57:09,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 02:57:09,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 02:57:09,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 02:57:09,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 02:57:09,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 02:57:09,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 02:57:09,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 02:57:09,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 02:57:09,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 02:57:09,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 02:57:09,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 02:57:09,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 02:57:09,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 02:57:09,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 02:57:09,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 02:57:09,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 02:57:09,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 02:57:09,856 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 02:57:09,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 02:57:09,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 02:57:09,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 02:57:09,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 02:57:09,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 02:57:09,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 02:57:09,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 02:57:09,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 02:57:09,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 02:57:09,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 02:57:09,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 02:57:09,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 02:57:09,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 02:57:09,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 02:57:09,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 02:57:09,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 02:57:09,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 02:57:09,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 02:57:09,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 02:57:09,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 02:57:09,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 02:57:09,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 02:57:09,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 02:57:09,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 02:57:09,897 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 02:57:09,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 02:57:09,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 02:57:09,898 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 02:57:09,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 02:57:09,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 02:57:09,899 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 02:57:09,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 02:57:09,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 02:57:09,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 02:57:09,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 02:57:09,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 02:57:09,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 02:57:09,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 02:57:09,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 02:57:09,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 02:57:09,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 02:57:09,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 02:57:09,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 02:57:09,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 02:57:09,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 02:57:09,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 02:57:09,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 02:57:09,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 02:57:09,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 02:57:09,903 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 02:57:09,903 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 02:57:09,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 02:57:09,904 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-14 02:57:10,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 02:57:10,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 02:57:10,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 02:57:10,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 02:57:10,120 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 02:57:10,120 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-14 02:57:10,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd5cb6d39/5b27122372cc41f7a00ee6d9846f8314/FLAG902af86b6 [2022-07-14 02:57:10,729 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 02:57:10,732 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-14 02:57:10,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd5cb6d39/5b27122372cc41f7a00ee6d9846f8314/FLAG902af86b6 [2022-07-14 02:57:10,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd5cb6d39/5b27122372cc41f7a00ee6d9846f8314 [2022-07-14 02:57:10,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 02:57:10,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 02:57:10,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 02:57:10,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 02:57:10,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 02:57:10,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:57:10" (1/1) ... [2022-07-14 02:57:10,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7daa174e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:10, skipping insertion in model container [2022-07-14 02:57:10,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:57:10" (1/1) ... [2022-07-14 02:57:10,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 02:57:11,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 02:57:12,565 WARN L230 ndardFunctionHandler]: Function 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-14 02:57:12,568 WARN L230 ndardFunctionHandler]: Function 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-14 02:57:12,568 WARN L230 ndardFunctionHandler]: Function 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-14 02:57:12,569 WARN L230 ndardFunctionHandler]: Function 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-14 02:57:12,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 02:57:12,619 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 02:57:12,948 WARN L230 ndardFunctionHandler]: Function 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-14 02:57:12,948 WARN L230 ndardFunctionHandler]: Function 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-14 02:57:12,949 WARN L230 ndardFunctionHandler]: Function 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-14 02:57:12,949 WARN L230 ndardFunctionHandler]: Function 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-14 02:57:12,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 02:57:13,096 INFO L208 MainTranslator]: Completed translation [2022-07-14 02:57:13,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13 WrapperNode [2022-07-14 02:57:13,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 02:57:13,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 02:57:13,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 02:57:13,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 02:57:13,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,345 INFO L137 Inliner]: procedures = 391, calls = 1784, calls flagged for inlining = 177, calls inlined = 156, statements flattened = 4311 [2022-07-14 02:57:13,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 02:57:13,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 02:57:13,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 02:57:13,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 02:57:13,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 02:57:13,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 02:57:13,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 02:57:13,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 02:57:13,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (1/1) ... [2022-07-14 02:57:13,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 02:57:13,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 02:57:13,580 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-14 02:57:13,585 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-14 02:57:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 02:57:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 02:57:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2022-07-14 02:57:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2022-07-14 02:57:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 02:57:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 02:57:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 02:57:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 02:57:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-14 02:57:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-14 02:57:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_66 [2022-07-14 02:57:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_66 [2022-07-14 02:57:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure dev_trans_start [2022-07-14 02:57:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_trans_start [2022-07-14 02:57:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_open [2022-07-14 02:57:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_open [2022-07-14 02:57:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_load_eeprom [2022-07-14 02:57:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_load_eeprom [2022-07-14 02:57:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-14 02:57:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_sense_lan [2022-07-14 02:57:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_sense_lan [2022-07-14 02:57:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 02:57:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 02:57:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-14 02:57:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-14 02:57:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-14 02:57:13,629 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-14 02:57:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 02:57:13,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 02:57:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-14 02:57:13,629 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-14 02:57:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 02:57:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-14 02:57:13,630 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-14 02:57:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_word [2022-07-14 02:57:13,630 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_word [2022-07-14 02:57:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 02:57:13,630 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 02:57:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_cascade_reset [2022-07-14 02:57:13,630 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_cascade_reset [2022-07-14 02:57:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 02:57:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-14 02:57:13,631 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-14 02:57:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 02:57:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 02:57:13,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 02:57:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 02:57:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-14 02:57:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-14 02:57:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 02:57:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 02:57:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_rx_bm [2022-07-14 02:57:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_rx_bm [2022-07-14 02:57:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_BM_shutdown [2022-07-14 02:57:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_BM_shutdown [2022-07-14 02:57:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-14 02:57:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-14 02:57:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 02:57:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 02:57:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure wait [2022-07-14 02:57:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure wait [2022-07-14 02:57:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-14 02:57:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-14 02:57:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_hwinit [2022-07-14 02:57:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_hwinit [2022-07-14 02:57:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-14 02:57:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-14 02:57:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_whatever [2022-07-14 02:57:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_whatever [2022-07-14 02:57:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_close [2022-07-14 02:57:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_close [2022-07-14 02:57:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-14 02:57:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-14 02:57:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 02:57:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_stop_interface [2022-07-14 02:57:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_stop_interface [2022-07-14 02:57:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_check_lan [2022-07-14 02:57:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_check_lan [2022-07-14 02:57:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-07-14 02:57:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-07-14 02:57:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 02:57:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 02:57:13,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 02:57:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-14 02:57:13,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-14 02:57:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 02:57:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-14 02:57:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 02:57:13,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 02:57:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 02:57:13,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 02:57:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-14 02:57:13,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-14 02:57:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_rxfill [2022-07-14 02:57:13,639 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_rxfill [2022-07-14 02:57:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 02:57:13,639 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 02:57:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-14 02:57:13,639 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-14 02:57:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-14 02:57:13,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-14 02:57:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 02:57:13,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 02:57:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_update_stats [2022-07-14 02:57:13,640 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_update_stats [2022-07-14 02:57:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 02:57:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 02:57:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 02:57:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 02:57:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 02:57:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 02:57:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-14 02:57:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-14 02:57:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 02:57:13,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 02:57:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-14 02:57:13,644 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-14 02:57:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 02:57:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 02:57:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 02:57:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-14 02:57:13,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-14 02:57:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-07-14 02:57:13,649 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-07-14 02:57:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 02:57:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 02:57:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-14 02:57:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-14 02:57:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 02:57:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 02:57:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-07-14 02:57:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-07-14 02:57:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_pci_remove [2022-07-14 02:57:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_pci_remove [2022-07-14 02:57:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_build_rx_pdl [2022-07-14 02:57:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_build_rx_pdl [2022-07-14 02:57:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-14 02:57:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-14 02:57:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-14 02:57:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-14 02:57:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-14 02:57:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-14 02:57:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_hp100_private [2022-07-14 02:57:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_hp100_private [2022-07-14 02:57:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 02:57:13,652 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2022-07-14 02:57:13,652 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2022-07-14 02:57:13,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 02:57:13,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 02:57:13,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_hp100_private [2022-07-14 02:57:13,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_hp100_private [2022-07-14 02:57:13,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_80 [2022-07-14 02:57:13,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_80 [2022-07-14 02:57:13,652 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2022-07-14 02:57:13,652 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2022-07-14 02:57:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-14 02:57:13,653 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-14 02:57:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 02:57:13,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 02:57:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_set_multicast_list [2022-07-14 02:57:13,653 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_set_multicast_list [2022-07-14 02:57:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_start_interface [2022-07-14 02:57:13,653 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_start_interface [2022-07-14 02:57:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-14 02:57:13,653 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-14 02:57:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_clean_txring [2022-07-14 02:57:13,654 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_clean_txring [2022-07-14 02:57:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-07-14 02:57:13,654 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-07-14 02:57:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 02:57:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure inw [2022-07-14 02:57:13,654 INFO L138 BoogieDeclarations]: Found implementation of procedure inw [2022-07-14 02:57:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-14 02:57:13,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-14 02:57:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_login_to_vg_hub [2022-07-14 02:57:13,655 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_login_to_vg_hub [2022-07-14 02:57:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-14 02:57:13,655 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-14 02:57:14,242 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 02:57:14,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 02:57:14,450 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 02:57:16,017 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-14 02:57:16,018 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 02:57:16,117 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563: SUMMARY for call #t~ret698#1 := schedule_timeout_interruptible(1); srcloc: null [2022-07-14 02:57:16,117 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563-1: assume -9223372036854775808 <= #t~ret698#1 && #t~ret698#1 <= 9223372036854775807;havoc #t~ret698#1; [2022-07-14 02:57:16,117 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-14 02:57:16,118 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-14 02:57:16,118 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-14 02:57:16,118 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-14 02:57:16,276 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 02:57:16,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 02:57:16,314 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 02:57:16,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:57:16 BoogieIcfgContainer [2022-07-14 02:57:16,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 02:57:16,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 02:57:16,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 02:57:16,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 02:57:16,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 02:57:10" (1/3) ... [2022-07-14 02:57:16,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d07fafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:57:16, skipping insertion in model container [2022-07-14 02:57:16,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:13" (2/3) ... [2022-07-14 02:57:16,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d07fafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:57:16, skipping insertion in model container [2022-07-14 02:57:16,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:57:16" (3/3) ... [2022-07-14 02:57:16,323 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i [2022-07-14 02:57:16,333 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 02:57:16,334 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-14 02:57:16,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 02:57:16,540 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@7dab3805, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b3d2570 [2022-07-14 02:57:16,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-14 02:57:16,554 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-14 02:57:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 02:57:16,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:57:16,578 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-14 02:57:16,578 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-14 02:57:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:57:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1256620244, now seen corresponding path program 1 times [2022-07-14 02:57:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:57:16,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838719260] [2022-07-14 02:57:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:57:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:57:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:57:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:57:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:57:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:57:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:57:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 02:57:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:17,181 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-14 02:57:17,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:57:17,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838719260] [2022-07-14 02:57:17,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838719260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:57:17,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:57:17,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:57:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528582403] [2022-07-14 02:57:17,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:57:17,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:57:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:57:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:57:17,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:57:17,222 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-14 02:57:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:57:21,741 INFO L93 Difference]: Finished difference Result 5452 states and 8256 transitions. [2022-07-14 02:57:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 02:57:21,743 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-14 02:57:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:57:21,786 INFO L225 Difference]: With dead ends: 5452 [2022-07-14 02:57:21,786 INFO L226 Difference]: Without dead ends: 3656 [2022-07-14 02:57:21,804 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-14 02:57:21,807 INFO L413 NwaCegarLoop]: 2523 mSDtfsCounter, 3273 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3814 SdHoareTripleChecker+Valid, 4420 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 02:57:21,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3814 Valid, 4420 Invalid, 4754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2123 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 02:57:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2022-07-14 02:57:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3484. [2022-07-14 02:57:22,071 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-14 02:57:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5048 transitions. [2022-07-14 02:57:22,095 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5048 transitions. Word has length 68 [2022-07-14 02:57:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:57:22,097 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 5048 transitions. [2022-07-14 02:57:22,097 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-14 02:57:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5048 transitions. [2022-07-14 02:57:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 02:57:22,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:57:22,105 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-14 02:57:22,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 02:57:22,105 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-14 02:57:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:57:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1472747592, now seen corresponding path program 1 times [2022-07-14 02:57:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:57:22,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359829197] [2022-07-14 02:57:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:57:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:57:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:57:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:57:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:57:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:57:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:57:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 02:57:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:22,375 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-14 02:57:22,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:57:22,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359829197] [2022-07-14 02:57:22,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359829197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:57:22,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:57:22,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:57:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244586981] [2022-07-14 02:57:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:57:22,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:57:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:57:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:57:22,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:57:22,381 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-14 02:57:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:57:26,262 INFO L93 Difference]: Finished difference Result 10244 states and 14936 transitions. [2022-07-14 02:57:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 02:57:26,263 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-14 02:57:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:57:26,300 INFO L225 Difference]: With dead ends: 10244 [2022-07-14 02:57:26,300 INFO L226 Difference]: Without dead ends: 6773 [2022-07-14 02:57:26,315 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-14 02:57:26,316 INFO L413 NwaCegarLoop]: 2806 mSDtfsCounter, 2768 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 1959 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3265 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 4511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1959 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-14 02:57:26,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3265 Valid, 4794 Invalid, 4511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1959 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-14 02:57:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2022-07-14 02:57:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6480. [2022-07-14 02:57:26,556 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-14 02:57:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 9434 transitions. [2022-07-14 02:57:26,583 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 9434 transitions. Word has length 73 [2022-07-14 02:57:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:57:26,585 INFO L495 AbstractCegarLoop]: Abstraction has 6480 states and 9434 transitions. [2022-07-14 02:57:26,585 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-14 02:57:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 9434 transitions. [2022-07-14 02:57:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 02:57:26,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:57:26,586 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-14 02:57:26,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 02:57:26,587 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-14 02:57:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:57:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -552311738, now seen corresponding path program 1 times [2022-07-14 02:57:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:57:26,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072743267] [2022-07-14 02:57:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:57:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:57:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:57:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:57:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:57:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:57:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:57:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 02:57:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:26,752 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-14 02:57:26,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:57:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072743267] [2022-07-14 02:57:26,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072743267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:57:26,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:57:26,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:57:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039354378] [2022-07-14 02:57:26,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:57:26,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:57:26,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:57:26,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:57:26,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:57:26,754 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-14 02:57:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:57:31,024 INFO L93 Difference]: Finished difference Result 19266 states and 28132 transitions. [2022-07-14 02:57:31,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 02:57:31,025 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-14 02:57:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:57:31,139 INFO L225 Difference]: With dead ends: 19266 [2022-07-14 02:57:31,139 INFO L226 Difference]: Without dead ends: 12799 [2022-07-14 02:57:31,173 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-14 02:57:31,174 INFO L413 NwaCegarLoop]: 2473 mSDtfsCounter, 3080 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 2116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3587 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 4716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2116 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-14 02:57:31,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3587 Valid, 4352 Invalid, 4716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2116 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-14 02:57:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12799 states. [2022-07-14 02:57:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12799 to 12258. [2022-07-14 02:57:32,033 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-14 02:57:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 17826 transitions. [2022-07-14 02:57:32,078 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 17826 transitions. Word has length 76 [2022-07-14 02:57:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:57:32,078 INFO L495 AbstractCegarLoop]: Abstraction has 12258 states and 17826 transitions. [2022-07-14 02:57:32,079 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-14 02:57:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 17826 transitions. [2022-07-14 02:57:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-14 02:57:32,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:57:32,081 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-14 02:57:32,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 02:57:32,081 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-14 02:57:32,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:57:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1165706419, now seen corresponding path program 1 times [2022-07-14 02:57:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:57:32,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656467371] [2022-07-14 02:57:32,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:57:32,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:57:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:57:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:57:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:57:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:57:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:57:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 02:57:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:32,230 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-14 02:57:32,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:57:32,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656467371] [2022-07-14 02:57:32,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656467371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:57:32,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:57:32,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:57:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643721311] [2022-07-14 02:57:32,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:57:32,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:57:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:57:32,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:57:32,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:57:32,235 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-14 02:57:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:57:35,107 INFO L93 Difference]: Finished difference Result 21372 states and 31042 transitions. [2022-07-14 02:57:35,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 02:57:35,116 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-14 02:57:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:57:35,164 INFO L225 Difference]: With dead ends: 21372 [2022-07-14 02:57:35,164 INFO L226 Difference]: Without dead ends: 9127 [2022-07-14 02:57:35,203 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-14 02:57:35,205 INFO L413 NwaCegarLoop]: 3131 mSDtfsCounter, 1944 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 1332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 5138 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1332 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 02:57:35,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 5138 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1332 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 02:57:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2022-07-14 02:57:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 8658. [2022-07-14 02:57:35,464 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-14 02:57:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8658 states to 8658 states and 12411 transitions. [2022-07-14 02:57:35,495 INFO L78 Accepts]: Start accepts. Automaton has 8658 states and 12411 transitions. Word has length 79 [2022-07-14 02:57:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:57:35,496 INFO L495 AbstractCegarLoop]: Abstraction has 8658 states and 12411 transitions. [2022-07-14 02:57:35,496 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-14 02:57:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 12411 transitions. [2022-07-14 02:57:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-14 02:57:35,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:57:35,500 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-14 02:57:35,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 02:57:35,500 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-14 02:57:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:57:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash 702077142, now seen corresponding path program 1 times [2022-07-14 02:57:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:57:35,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115626727] [2022-07-14 02:57:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:57:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:57:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:57:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:57:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:57:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:57:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:57:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:57:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 02:57:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 02:57:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 02:57:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:57:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:35,639 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-14 02:57:35,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:57:35,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115626727] [2022-07-14 02:57:35,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115626727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:57:35,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:57:35,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:57:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325635466] [2022-07-14 02:57:35,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:57:35,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:57:35,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:57:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:57:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:57:35,641 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-14 02:57:39,646 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-14 02:57:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:57:40,299 INFO L93 Difference]: Finished difference Result 17703 states and 25466 transitions. [2022-07-14 02:57:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 02:57:40,300 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-14 02:57:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:57:40,339 INFO L225 Difference]: With dead ends: 17703 [2022-07-14 02:57:40,340 INFO L226 Difference]: Without dead ends: 9099 [2022-07-14 02:57:40,370 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-14 02:57:40,371 INFO L413 NwaCegarLoop]: 2280 mSDtfsCounter, 768 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 582 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 4189 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 02:57:40,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 4189 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2055 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 02:57:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2022-07-14 02:57:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 8658. [2022-07-14 02:57:40,640 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-14 02:57:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8658 states to 8658 states and 12403 transitions. [2022-07-14 02:57:40,670 INFO L78 Accepts]: Start accepts. Automaton has 8658 states and 12403 transitions. Word has length 107 [2022-07-14 02:57:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:57:40,670 INFO L495 AbstractCegarLoop]: Abstraction has 8658 states and 12403 transitions. [2022-07-14 02:57:40,671 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-14 02:57:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 12403 transitions. [2022-07-14 02:57:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-14 02:57:40,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:57:40,673 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-14 02:57:40,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 02:57:40,673 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-14 02:57:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:57:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash -288027847, now seen corresponding path program 1 times [2022-07-14 02:57:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:57:40,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323091197] [2022-07-14 02:57:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:57:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:57:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:57:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:57:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:57:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:57:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:57:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:57:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:57:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:57:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:57:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:57:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:57:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:57:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:40,895 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-14 02:57:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:57:40,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323091197] [2022-07-14 02:57:40,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323091197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:57:40,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:57:40,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:57:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071915442] [2022-07-14 02:57:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:57:40,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:57:40,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:57:40,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:57:40,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:57:40,898 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-14 02:57:46,754 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-14 02:57:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:57:47,713 INFO L93 Difference]: Finished difference Result 26375 states and 38008 transitions. [2022-07-14 02:57:47,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 02:57:47,714 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-14 02:57:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:57:47,792 INFO L225 Difference]: With dead ends: 26375 [2022-07-14 02:57:47,793 INFO L226 Difference]: Without dead ends: 17771 [2022-07-14 02:57:47,830 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-14 02:57:47,830 INFO L413 NwaCegarLoop]: 2625 mSDtfsCounter, 3212 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 2123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3748 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-14 02:57:47,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3748 Valid, 4592 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2123 Valid, 2631 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-14 02:57:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17771 states. [2022-07-14 02:57:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17771 to 16867. [2022-07-14 02:57:48,580 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-14 02:57:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 24221 transitions. [2022-07-14 02:57:48,648 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 24221 transitions. Word has length 123 [2022-07-14 02:57:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:57:48,649 INFO L495 AbstractCegarLoop]: Abstraction has 16867 states and 24221 transitions. [2022-07-14 02:57:48,649 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-14 02:57:48,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 24221 transitions. [2022-07-14 02:57:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-14 02:57:48,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:57:48,651 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-14 02:57:48,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 02:57:48,651 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-14 02:57:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:57:48,652 INFO L85 PathProgramCache]: Analyzing trace with hash 134673979, now seen corresponding path program 1 times [2022-07-14 02:57:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:57:48,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072155362] [2022-07-14 02:57:48,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:57:48,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:57:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:57:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:57:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:57:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:57:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:57:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:57:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:57:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:57:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:57:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:57:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:57:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:57:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:48,934 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-14 02:57:48,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:57:48,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072155362] [2022-07-14 02:57:48,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072155362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:57:48,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:57:48,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:57:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673917293] [2022-07-14 02:57:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:57:48,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:57:48,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:57:48,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:57:48,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:57:48,936 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-14 02:57:54,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 02:57:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:57:55,336 INFO L93 Difference]: Finished difference Result 17755 states and 25634 transitions. [2022-07-14 02:57:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:57:55,359 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-14 02:57:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:57:55,443 INFO L225 Difference]: With dead ends: 17755 [2022-07-14 02:57:55,444 INFO L226 Difference]: Without dead ends: 17753 [2022-07-14 02:57:55,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-14 02:57:55,453 INFO L413 NwaCegarLoop]: 2267 mSDtfsCounter, 2529 mSDsluCounter, 3076 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 1584 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2741 SdHoareTripleChecker+Valid, 5343 SdHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1584 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-14 02:57:55,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2741 Valid, 5343 Invalid, 5116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1584 Valid, 3531 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-14 02:57:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17753 states. [2022-07-14 02:57:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17753 to 16871. [2022-07-14 02:57:56,137 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-14 02:57:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16871 states to 16871 states and 24224 transitions. [2022-07-14 02:57:56,520 INFO L78 Accepts]: Start accepts. Automaton has 16871 states and 24224 transitions. Word has length 123 [2022-07-14 02:57:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:57:56,520 INFO L495 AbstractCegarLoop]: Abstraction has 16871 states and 24224 transitions. [2022-07-14 02:57:56,521 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-14 02:57:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 16871 states and 24224 transitions. [2022-07-14 02:57:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 02:57:56,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:57:56,523 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-14 02:57:56,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 02:57:56,523 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-14 02:57:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:57:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash 119085821, now seen corresponding path program 1 times [2022-07-14 02:57:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:57:56,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594956305] [2022-07-14 02:57:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:57:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:57:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:57:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:57:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:57:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:57:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:57:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:57:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:57:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:57:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:57:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:57:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:57:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:57:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:57:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 02:57:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:57:56,745 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-14 02:57:56,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:57:56,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594956305] [2022-07-14 02:57:56,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594956305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:57:56,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:57:56,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:57:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835031862] [2022-07-14 02:57:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:57:56,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:57:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:57:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:57:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:57:56,747 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-14 02:58:01,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 02:58:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:58:02,832 INFO L93 Difference]: Finished difference Result 17759 states and 25637 transitions. [2022-07-14 02:58:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:58:02,833 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-14 02:58:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:58:02,978 INFO L225 Difference]: With dead ends: 17759 [2022-07-14 02:58:02,987 INFO L226 Difference]: Without dead ends: 17757 [2022-07-14 02:58:03,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 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-14 02:58:03,012 INFO L413 NwaCegarLoop]: 2269 mSDtfsCounter, 2521 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 1583 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 5115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1583 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-14 02:58:03,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5342 Invalid, 5115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1583 Valid, 3531 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-14 02:58:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17757 states. [2022-07-14 02:58:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17757 to 16875. [2022-07-14 02:58:03,804 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-14 02:58:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16875 states to 16875 states and 24227 transitions. [2022-07-14 02:58:03,951 INFO L78 Accepts]: Start accepts. Automaton has 16875 states and 24227 transitions. Word has length 128 [2022-07-14 02:58:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:58:03,951 INFO L495 AbstractCegarLoop]: Abstraction has 16875 states and 24227 transitions. [2022-07-14 02:58:03,951 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-14 02:58:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 16875 states and 24227 transitions. [2022-07-14 02:58:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-14 02:58:03,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:58:03,954 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-14 02:58:03,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 02:58:03,954 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-14 02:58:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:58:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1558624059, now seen corresponding path program 1 times [2022-07-14 02:58:03,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:58:03,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478882438] [2022-07-14 02:58:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:58:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:58:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:58:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:58:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:58:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:58:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:58:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:58:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:58:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:58:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:58:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:58:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:58:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:58:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 02:58:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:58:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:04,135 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-14 02:58:04,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:58:04,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478882438] [2022-07-14 02:58:04,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478882438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:58:04,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:58:04,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:58:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485387676] [2022-07-14 02:58:04,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:58:04,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:58:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:58:04,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:58:04,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:58:04,138 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-14 02:58:08,878 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-14 02:58:11,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 02:58:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:58:12,084 INFO L93 Difference]: Finished difference Result 17763 states and 25640 transitions. [2022-07-14 02:58:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:58:12,085 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-14 02:58:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:58:12,189 INFO L225 Difference]: With dead ends: 17763 [2022-07-14 02:58:12,203 INFO L226 Difference]: Without dead ends: 17761 [2022-07-14 02:58:12,225 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-14 02:58:12,228 INFO L413 NwaCegarLoop]: 2269 mSDtfsCounter, 2521 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 1582 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 5114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1582 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-14 02:58:12,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5342 Invalid, 5114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1582 Valid, 3530 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-07-14 02:58:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17761 states. [2022-07-14 02:58:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17761 to 16879. [2022-07-14 02:58:12,952 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-14 02:58:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16879 states to 16879 states and 24230 transitions. [2022-07-14 02:58:13,024 INFO L78 Accepts]: Start accepts. Automaton has 16879 states and 24230 transitions. Word has length 133 [2022-07-14 02:58:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:58:13,024 INFO L495 AbstractCegarLoop]: Abstraction has 16879 states and 24230 transitions. [2022-07-14 02:58:13,025 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-14 02:58:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 16879 states and 24230 transitions. [2022-07-14 02:58:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 02:58:13,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:58:13,027 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-14 02:58:13,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 02:58:13,028 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-14 02:58:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:58:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1025780093, now seen corresponding path program 1 times [2022-07-14 02:58:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:58:13,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370994072] [2022-07-14 02:58:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:58:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:58:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:58:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:58:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:58:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:58:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:58:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:58:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:58:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:58:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:58:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:58:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:58:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:58:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 02:58:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:58:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 02:58:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:13,326 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-14 02:58:13,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:58:13,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370994072] [2022-07-14 02:58:13,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370994072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:58:13,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:58:13,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:58:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671426402] [2022-07-14 02:58:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:58:13,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:58:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:58:13,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:58:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:58:13,328 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-14 02:58:18,720 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-14 02:58:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:58:19,657 INFO L93 Difference]: Finished difference Result 17767 states and 25643 transitions. [2022-07-14 02:58:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:58:19,658 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-14 02:58:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:58:19,728 INFO L225 Difference]: With dead ends: 17767 [2022-07-14 02:58:19,729 INFO L226 Difference]: Without dead ends: 17765 [2022-07-14 02:58:19,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 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-14 02:58:19,744 INFO L413 NwaCegarLoop]: 2272 mSDtfsCounter, 2520 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 1579 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2732 SdHoareTripleChecker+Valid, 5352 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1579 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-14 02:58:19,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2732 Valid, 5352 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1579 Valid, 3531 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-07-14 02:58:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17765 states. [2022-07-14 02:58:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17765 to 16883. [2022-07-14 02:58:20,426 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-14 02:58:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16883 states to 16883 states and 24233 transitions. [2022-07-14 02:58:20,491 INFO L78 Accepts]: Start accepts. Automaton has 16883 states and 24233 transitions. Word has length 138 [2022-07-14 02:58:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:58:20,491 INFO L495 AbstractCegarLoop]: Abstraction has 16883 states and 24233 transitions. [2022-07-14 02:58:20,492 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-14 02:58:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 16883 states and 24233 transitions. [2022-07-14 02:58:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-14 02:58:20,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:58:20,497 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-14 02:58:20,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 02:58:20,497 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-14 02:58:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:58:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1519618408, now seen corresponding path program 1 times [2022-07-14 02:58:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:58:20,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855633258] [2022-07-14 02:58:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:58:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:58:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:58:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:58:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:58:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:58:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:58:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:58:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:58:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:58:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 02:58:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 02:58:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 02:58:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 02:58:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 02:58:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:20,789 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-14 02:58:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:58:20,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855633258] [2022-07-14 02:58:20,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855633258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:58:20,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:58:20,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:58:20,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739853308] [2022-07-14 02:58:20,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:58:20,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:58:20,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:58:20,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:58:20,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:58:20,792 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-14 02:58:25,383 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-14 02:58:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:58:27,231 INFO L93 Difference]: Finished difference Result 39594 states and 56950 transitions. [2022-07-14 02:58:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 02:58:27,232 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-14 02:58:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:58:27,340 INFO L225 Difference]: With dead ends: 39594 [2022-07-14 02:58:27,340 INFO L226 Difference]: Without dead ends: 22765 [2022-07-14 02:58:27,396 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-14 02:58:27,396 INFO L413 NwaCegarLoop]: 3518 mSDtfsCounter, 1803 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 1242 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 5751 SdHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1242 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-14 02:58:27,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 5751 Invalid, 3734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1242 Valid, 2491 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-07-14 02:58:27,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22765 states. [2022-07-14 02:58:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22765 to 21461. [2022-07-14 02:58:28,254 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-14 02:58:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21461 states to 21461 states and 30619 transitions. [2022-07-14 02:58:28,359 INFO L78 Accepts]: Start accepts. Automaton has 21461 states and 30619 transitions. Word has length 142 [2022-07-14 02:58:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:58:28,361 INFO L495 AbstractCegarLoop]: Abstraction has 21461 states and 30619 transitions. [2022-07-14 02:58:28,361 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-14 02:58:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 21461 states and 30619 transitions. [2022-07-14 02:58:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-14 02:58:28,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:58:28,372 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-14 02:58:28,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 02:58:28,372 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-14 02:58:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:58:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash -197466053, now seen corresponding path program 1 times [2022-07-14 02:58:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:58:28,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295088095] [2022-07-14 02:58:28,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:58:28,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:58:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:58:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:58:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:58:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:58:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:58:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:58:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:58:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:58:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:58:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:58:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:58:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:58:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 02:58:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:58:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 02:58:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 02:58:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:28,870 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-14 02:58:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:58:28,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295088095] [2022-07-14 02:58:28,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295088095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:58:28,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:58:28,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:58:28,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687791349] [2022-07-14 02:58:28,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:58:28,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:58:28,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:58:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:58:29,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:58:29,011 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-14 02:58:34,041 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-14 02:58:36,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 02:58:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:58:36,986 INFO L93 Difference]: Finished difference Result 22727 states and 32616 transitions. [2022-07-14 02:58:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:58:36,986 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-14 02:58:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:58:37,084 INFO L225 Difference]: With dead ends: 22727 [2022-07-14 02:58:37,085 INFO L226 Difference]: Without dead ends: 22725 [2022-07-14 02:58:37,104 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-14 02:58:37,104 INFO L413 NwaCegarLoop]: 2268 mSDtfsCounter, 2521 mSDsluCounter, 3070 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 1580 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2735 SdHoareTripleChecker+Valid, 5338 SdHoareTripleChecker+Invalid, 5112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1580 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-14 02:58:37,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2735 Valid, 5338 Invalid, 5112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1580 Valid, 3530 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-07-14 02:58:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22725 states. [2022-07-14 02:58:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22725 to 21465. [2022-07-14 02:58:37,947 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-14 02:58:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21465 states to 21465 states and 30622 transitions. [2022-07-14 02:58:38,047 INFO L78 Accepts]: Start accepts. Automaton has 21465 states and 30622 transitions. Word has length 143 [2022-07-14 02:58:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:58:38,048 INFO L495 AbstractCegarLoop]: Abstraction has 21465 states and 30622 transitions. [2022-07-14 02:58:38,048 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-14 02:58:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 21465 states and 30622 transitions. [2022-07-14 02:58:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-14 02:58:38,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:58:38,074 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-14 02:58:38,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 02:58:38,074 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-14 02:58:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:58:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1861665026, now seen corresponding path program 1 times [2022-07-14 02:58:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:58:38,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101216359] [2022-07-14 02:58:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:58:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:58:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:58:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:58:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:58:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:58:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:58:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:58:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:58:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:58:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:58:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:58:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:58:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 02:58:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 02:58:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:58:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 02:58:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 02:58:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 02:58:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 02:58:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 02:58:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:38,513 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-14 02:58:38,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:58:38,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101216359] [2022-07-14 02:58:38,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101216359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:58:38,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:58:38,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:58:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662289369] [2022-07-14 02:58:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:58:38,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:58:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:58:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:58:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:58:38,515 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-14 02:58:43,311 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-14 02:58:45,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 02:58:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:58:46,585 INFO L93 Difference]: Finished difference Result 22731 states and 32619 transitions. [2022-07-14 02:58:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:58:46,586 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-14 02:58:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:58:46,698 INFO L225 Difference]: With dead ends: 22731 [2022-07-14 02:58:46,698 INFO L226 Difference]: Without dead ends: 22729 [2022-07-14 02:58:46,720 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-14 02:58:46,729 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 2511 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 1577 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 3530 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-14 02:58:46,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2722 Valid, 5348 Invalid, 5109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1577 Valid, 3530 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-14 02:58:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22729 states. [2022-07-14 02:58:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22729 to 21469. [2022-07-14 02:58:47,961 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-14 02:58:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21469 states to 21469 states and 30625 transitions. [2022-07-14 02:58:48,044 INFO L78 Accepts]: Start accepts. Automaton has 21469 states and 30625 transitions. Word has length 166 [2022-07-14 02:58:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:58:48,045 INFO L495 AbstractCegarLoop]: Abstraction has 21469 states and 30625 transitions. [2022-07-14 02:58:48,045 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-14 02:58:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21469 states and 30625 transitions. [2022-07-14 02:58:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-14 02:58:48,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:58:48,047 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-14 02:58:48,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 02:58:48,048 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-14 02:58:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:58:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1530366267, now seen corresponding path program 1 times [2022-07-14 02:58:48,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:58:48,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520979873] [2022-07-14 02:58:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:58:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:58:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:58:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:58:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:58:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:58:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:58:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:58:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:58:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:58:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:58:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:58:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:58:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:58:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 02:58:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:58:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 02:58:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 02:58:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 02:58:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 02:58:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:48,226 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-14 02:58:48,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:58:48,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520979873] [2022-07-14 02:58:48,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520979873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:58:48,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:58:48,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:58:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325750057] [2022-07-14 02:58:48,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:58:48,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:58:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:58:48,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:58:48,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:58:48,228 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-14 02:58:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:58:55,880 INFO L93 Difference]: Finished difference Result 26901 states and 38530 transitions. [2022-07-14 02:58:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 02:58:55,881 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-14 02:58:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:58:55,980 INFO L225 Difference]: With dead ends: 26901 [2022-07-14 02:58:55,980 INFO L226 Difference]: Without dead ends: 26899 [2022-07-14 02:58:55,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 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-14 02:58:55,999 INFO L413 NwaCegarLoop]: 2529 mSDtfsCounter, 2114 mSDsluCounter, 3452 mSDsCounter, 0 mSdLazyCounter, 4874 mSolverCounterSat, 1445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2355 SdHoareTripleChecker+Valid, 5981 SdHoareTripleChecker+Invalid, 6319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1445 IncrementalHoareTripleChecker+Valid, 4874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 02:58:56,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2355 Valid, 5981 Invalid, 6319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1445 Valid, 4874 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 02:58:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26899 states. [2022-07-14 02:58:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26899 to 25623. [2022-07-14 02:58:57,157 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-14 02:58:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25623 states to 25623 states and 36528 transitions. [2022-07-14 02:58:57,268 INFO L78 Accepts]: Start accepts. Automaton has 25623 states and 36528 transitions. Word has length 153 [2022-07-14 02:58:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:58:57,268 INFO L495 AbstractCegarLoop]: Abstraction has 25623 states and 36528 transitions. [2022-07-14 02:58:57,269 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-14 02:58:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 25623 states and 36528 transitions. [2022-07-14 02:58:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-14 02:58:57,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:58:57,270 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-14 02:58:57,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 02:58:57,271 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-14 02:58:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:58:57,271 INFO L85 PathProgramCache]: Analyzing trace with hash 184219261, now seen corresponding path program 1 times [2022-07-14 02:58:57,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:58:57,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377285478] [2022-07-14 02:58:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:58:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:58:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:58:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:58:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:58:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:58:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:58:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:58:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:58:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:58:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:58:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:58:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:58:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:58:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:58:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 02:58:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:58:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 02:58:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 02:58:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 02:58:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 02:58:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 02:58:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:58:57,455 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-14 02:58:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:58:57,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377285478] [2022-07-14 02:58:57,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377285478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:58:57,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:58:57,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:58:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253808442] [2022-07-14 02:58:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:58:57,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:58:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:58:57,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:58:57,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:58:57,457 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-14 02:59:03,607 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-14 02:59:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:59:05,160 INFO L93 Difference]: Finished difference Result 26905 states and 38533 transitions. [2022-07-14 02:59:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:59:05,161 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-14 02:59:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:59:05,281 INFO L225 Difference]: With dead ends: 26905 [2022-07-14 02:59:05,281 INFO L226 Difference]: Without dead ends: 26903 [2022-07-14 02:59:05,304 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-14 02:59:05,305 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 2520 mSDsluCounter, 3076 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1574 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5347 SdHoareTripleChecker+Invalid, 5103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1574 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 02:59:05,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5347 Invalid, 5103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1574 Valid, 3528 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 02:59:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26903 states. [2022-07-14 02:59:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26903 to 25627. [2022-07-14 02:59:06,473 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-14 02:59:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25627 states to 25627 states and 36531 transitions. [2022-07-14 02:59:06,568 INFO L78 Accepts]: Start accepts. Automaton has 25627 states and 36531 transitions. Word has length 158 [2022-07-14 02:59:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:59:06,569 INFO L495 AbstractCegarLoop]: Abstraction has 25627 states and 36531 transitions. [2022-07-14 02:59:06,569 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-14 02:59:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 25627 states and 36531 transitions. [2022-07-14 02:59:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-14 02:59:06,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:59:06,571 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-14 02:59:06,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 02:59:06,571 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-14 02:59:06,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:59:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1461900950, now seen corresponding path program 1 times [2022-07-14 02:59:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:59:06,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841275261] [2022-07-14 02:59:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:59:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:59:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:59:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:59:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:59:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:59:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:59:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:59:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:59:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:59:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:59:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:59:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:59:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 02:59:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 02:59:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:59:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 02:59:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 02:59:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 02:59:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 02:59:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 02:59:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 02:59:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 02:59:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-14 02:59:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:06,875 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-14 02:59:06,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:59:06,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841275261] [2022-07-14 02:59:06,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841275261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:59:06,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:59:06,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:59:06,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567078680] [2022-07-14 02:59:06,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:59:06,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:59:06,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:59:06,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:59:06,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:59:06,879 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-14 02:59:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:59:12,542 INFO L93 Difference]: Finished difference Result 26909 states and 38536 transitions. [2022-07-14 02:59:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:59:12,543 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-14 02:59:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:59:12,732 INFO L225 Difference]: With dead ends: 26909 [2022-07-14 02:59:12,732 INFO L226 Difference]: Without dead ends: 26907 [2022-07-14 02:59:12,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 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-14 02:59:12,747 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2513 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 3529 mSolverCounterSat, 1573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 5102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1573 IncrementalHoareTripleChecker+Valid, 3529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-14 02:59:12,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 5345 Invalid, 5102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1573 Valid, 3529 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-14 02:59:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26907 states. [2022-07-14 02:59:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26907 to 25631. [2022-07-14 02:59:13,756 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-14 02:59:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25631 states to 25631 states and 36534 transitions. [2022-07-14 02:59:13,841 INFO L78 Accepts]: Start accepts. Automaton has 25631 states and 36534 transitions. Word has length 181 [2022-07-14 02:59:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:59:13,842 INFO L495 AbstractCegarLoop]: Abstraction has 25631 states and 36534 transitions. [2022-07-14 02:59:13,842 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-14 02:59:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 25631 states and 36534 transitions. [2022-07-14 02:59:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 02:59:13,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:59:13,843 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-14 02:59:13,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 02:59:13,844 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-14 02:59:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:59:13,844 INFO L85 PathProgramCache]: Analyzing trace with hash 442414333, now seen corresponding path program 1 times [2022-07-14 02:59:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:59:13,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638410618] [2022-07-14 02:59:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:59:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:59:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:59:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:59:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:59:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:59:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:59:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:59:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:59:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:59:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:59:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:59:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:59:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 02:59:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 02:59:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:59:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 02:59:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 02:59:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 02:59:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 02:59:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 02:59:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 02:59:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 02:59:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:13,999 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-14 02:59:13,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:59:13,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638410618] [2022-07-14 02:59:13,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638410618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:59:13,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:59:13,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:59:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014121013] [2022-07-14 02:59:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:59:14,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:59:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:59:14,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:59:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:59:14,001 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-14 02:59:19,288 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-14 02:59:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:59:20,693 INFO L93 Difference]: Finished difference Result 26913 states and 38539 transitions. [2022-07-14 02:59:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:59:20,693 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-14 02:59:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:59:20,791 INFO L225 Difference]: With dead ends: 26913 [2022-07-14 02:59:20,791 INFO L226 Difference]: Without dead ends: 26911 [2022-07-14 02:59:20,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 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-14 02:59:20,811 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2522 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1572 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 5.7s IncrementalHoareTripleChecker+Time [2022-07-14 02:59:20,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2735 Valid, 5345 Invalid, 5101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1572 Valid, 3528 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-14 02:59:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26911 states. [2022-07-14 02:59:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26911 to 25635. [2022-07-14 02:59:21,822 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-14 02:59:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25635 states to 25635 states and 36537 transitions. [2022-07-14 02:59:21,918 INFO L78 Accepts]: Start accepts. Automaton has 25635 states and 36537 transitions. Word has length 168 [2022-07-14 02:59:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:59:21,918 INFO L495 AbstractCegarLoop]: Abstraction has 25635 states and 36537 transitions. [2022-07-14 02:59:21,919 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-14 02:59:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 25635 states and 36537 transitions. [2022-07-14 02:59:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-14 02:59:21,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:59:21,921 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-14 02:59:21,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 02:59:21,922 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-14 02:59:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:59:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1505550806, now seen corresponding path program 1 times [2022-07-14 02:59:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:59:21,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67321958] [2022-07-14 02:59:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:59:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:59:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:59:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:59:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:59:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:59:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:59:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:59:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:59:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:59:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:59:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:59:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:59:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 02:59:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 02:59:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:59:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 02:59:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 02:59:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 02:59:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 02:59:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 02:59:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 02:59:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 02:59:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-14 02:59:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 02:59:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 02:59:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:22,507 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-14 02:59:22,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:59:22,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67321958] [2022-07-14 02:59:22,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67321958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:59:22,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:59:22,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:59:22,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223969500] [2022-07-14 02:59:22,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:59:22,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:59:22,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:59:22,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:59:22,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:59:22,509 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-14 02:59:28,434 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-14 02:59:30,519 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-14 02:59:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:59:31,744 INFO L93 Difference]: Finished difference Result 26917 states and 38542 transitions. [2022-07-14 02:59:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:59:31,745 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-14 02:59:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:59:31,817 INFO L225 Difference]: With dead ends: 26917 [2022-07-14 02:59:31,818 INFO L226 Difference]: Without dead ends: 26913 [2022-07-14 02:59:31,832 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-14 02:59:31,832 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2513 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 1571 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s 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.2s IncrementalHoareTripleChecker+Time [2022-07-14 02:59:31,833 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.2s Time] [2022-07-14 02:59:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26913 states. [2022-07-14 02:59:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26913 to 25637. [2022-07-14 02:59:33,013 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-14 02:59:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25637 states to 25637 states and 36538 transitions. [2022-07-14 02:59:33,106 INFO L78 Accepts]: Start accepts. Automaton has 25637 states and 36538 transitions. Word has length 191 [2022-07-14 02:59:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:59:33,107 INFO L495 AbstractCegarLoop]: Abstraction has 25637 states and 36538 transitions. [2022-07-14 02:59:33,107 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-14 02:59:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 25637 states and 36538 transitions. [2022-07-14 02:59:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-14 02:59:33,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:59:33,116 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-14 02:59:33,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 02:59:33,116 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-14 02:59:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:59:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1962924606, now seen corresponding path program 1 times [2022-07-14 02:59:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:59:33,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252100421] [2022-07-14 02:59:33,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:59:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:59:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:59:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:59:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:59:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:59:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:59:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:59:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:59:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:59:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 02:59:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 02:59:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 02:59:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 02:59:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 02:59:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 02:59:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 02:59:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 02:59:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 02:59:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 02:59:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 02:59:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 02:59:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 02:59:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-14 02:59:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 02:59:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 02:59:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 02:59:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:33,402 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-14 02:59:33,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:59:33,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252100421] [2022-07-14 02:59:33,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252100421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:59:33,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:59:33,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 02:59:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308693195] [2022-07-14 02:59:33,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:59:33,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 02:59:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:59:33,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 02:59:33,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 02:59:33,404 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-14 02:59:38,995 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-14 02:59:41,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 02:59:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:59:42,610 INFO L93 Difference]: Finished difference Result 26913 states and 38538 transitions. [2022-07-14 02:59:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 02:59:42,621 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-14 02:59:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:59:42,709 INFO L225 Difference]: With dead ends: 26913 [2022-07-14 02:59:42,710 INFO L226 Difference]: Without dead ends: 26689 [2022-07-14 02:59:42,727 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-14 02:59:42,728 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2505 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 1570 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2715 SdHoareTripleChecker+Valid, 5352 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1570 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-14 02:59:42,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2715 Valid, 5352 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1570 Valid, 3522 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2022-07-14 02:59:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26689 states. [2022-07-14 02:59:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26689 to 25413. [2022-07-14 02:59:44,196 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-14 02:59:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25413 states to 25413 states and 36219 transitions. [2022-07-14 02:59:44,287 INFO L78 Accepts]: Start accepts. Automaton has 25413 states and 36219 transitions. Word has length 196 [2022-07-14 02:59:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:59:44,287 INFO L495 AbstractCegarLoop]: Abstraction has 25413 states and 36219 transitions. [2022-07-14 02:59:44,287 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-14 02:59:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25413 states and 36219 transitions. [2022-07-14 02:59:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-14 02:59:44,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:59:44,290 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-14 02:59:44,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 02:59:44,290 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-14 02:59:44,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:59:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash -968498435, now seen corresponding path program 1 times [2022-07-14 02:59:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:59:44,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019334629] [2022-07-14 02:59:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:59:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:59:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:59:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:59:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:59:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:59:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:59:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:59:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:59:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:59:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 02:59:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 02:59:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 02:59:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 02:59:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 02:59:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:59:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 02:59:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 02:59:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:59:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 02:59:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-14 02:59:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 02:59:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 02:59:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:44,438 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-14 02:59:44,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:59:44,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019334629] [2022-07-14 02:59:44,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019334629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:59:44,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:59:44,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:59:44,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919692997] [2022-07-14 02:59:44,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:59:44,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:59:44,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:59:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:59:44,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:59:44,440 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-14 02:59:49,410 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-14 02:59:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 02:59:51,887 INFO L93 Difference]: Finished difference Result 57921 states and 82741 transitions. [2022-07-14 02:59:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 02:59:51,888 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-14 02:59:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 02:59:51,988 INFO L225 Difference]: With dead ends: 57921 [2022-07-14 02:59:51,989 INFO L226 Difference]: Without dead ends: 32519 [2022-07-14 02:59:52,098 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-14 02:59:52,099 INFO L413 NwaCegarLoop]: 3498 mSDtfsCounter, 1766 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 1158 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1158 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-14 02:59:52,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 5720 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1158 Valid, 2419 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-07-14 02:59:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32519 states. [2022-07-14 02:59:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32519 to 30857. [2022-07-14 02:59:53,611 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-14 02:59:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30857 states to 30857 states and 43851 transitions. [2022-07-14 02:59:53,752 INFO L78 Accepts]: Start accepts. Automaton has 30857 states and 43851 transitions. Word has length 216 [2022-07-14 02:59:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 02:59:53,753 INFO L495 AbstractCegarLoop]: Abstraction has 30857 states and 43851 transitions. [2022-07-14 02:59:53,753 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-14 02:59:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 30857 states and 43851 transitions. [2022-07-14 02:59:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-14 02:59:53,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 02:59:53,756 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-14 02:59:53,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 02:59:53,756 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-14 02:59:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 02:59:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash -693738821, now seen corresponding path program 1 times [2022-07-14 02:59:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 02:59:53,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114957566] [2022-07-14 02:59:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 02:59:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 02:59:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 02:59:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 02:59:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 02:59:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 02:59:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 02:59:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 02:59:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 02:59:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 02:59:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 02:59:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 02:59:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 02:59:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 02:59:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 02:59:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:59:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 02:59:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 02:59:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 02:59:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 02:59:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 02:59:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-14 02:59:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 02:59:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 02:59:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 02:59:53,946 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-14 02:59:53,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 02:59:53,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114957566] [2022-07-14 02:59:53,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114957566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 02:59:53,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 02:59:53,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 02:59:53,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32924494] [2022-07-14 02:59:53,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 02:59:53,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 02:59:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 02:59:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 02:59:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 02:59:53,948 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-14 03:00:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 03:00:00,534 INFO L93 Difference]: Finished difference Result 74180 states and 106059 transitions. [2022-07-14 03:00:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 03:00:00,535 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-14 03:00:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 03:00:00,709 INFO L225 Difference]: With dead ends: 74180 [2022-07-14 03:00:00,709 INFO L226 Difference]: Without dead ends: 43377 [2022-07-14 03:00:00,790 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-14 03:00:00,790 INFO L413 NwaCegarLoop]: 3758 mSDtfsCounter, 2337 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 1482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2850 SdHoareTripleChecker+Valid, 5638 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1482 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 03:00:00,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2850 Valid, 5638 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1482 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 03:00:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43377 states. [2022-07-14 03:00:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43377 to 41217. [2022-07-14 03:00:02,692 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-14 03:00:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41217 states to 41217 states and 58808 transitions. [2022-07-14 03:00:02,843 INFO L78 Accepts]: Start accepts. Automaton has 41217 states and 58808 transitions. Word has length 216 [2022-07-14 03:00:02,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 03:00:02,844 INFO L495 AbstractCegarLoop]: Abstraction has 41217 states and 58808 transitions. [2022-07-14 03:00:02,845 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-14 03:00:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 41217 states and 58808 transitions. [2022-07-14 03:00:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-14 03:00:02,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 03:00:02,866 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-14 03:00:02,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 03:00:02,867 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-14 03:00:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 03:00:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 499296066, now seen corresponding path program 1 times [2022-07-14 03:00:02,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 03:00:02,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006626160] [2022-07-14 03:00:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 03:00:02,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 03:00:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 03:00:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 03:00:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 03:00:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 03:00:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 03:00:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 03:00:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 03:00:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 03:00:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 03:00:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 03:00:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 03:00:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 03:00:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 03:00:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 03:00:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 03:00:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 03:00:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 03:00:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 03:00:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-14 03:00:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 03:00:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-14 03:00:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-14 03:00:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-14 03:00:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-14 03:00:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 03:00:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:03,103 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-14 03:00:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 03:00:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006626160] [2022-07-14 03:00:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006626160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 03:00:03,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 03:00:03,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 03:00:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711830981] [2022-07-14 03:00:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 03:00:03,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 03:00:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 03:00:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 03:00:03,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 03:00:03,118 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-14 03:00:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 03:00:10,327 INFO L93 Difference]: Finished difference Result 90386 states and 129255 transitions. [2022-07-14 03:00:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 03:00:10,328 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-14 03:00:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 03:00:10,778 INFO L225 Difference]: With dead ends: 90386 [2022-07-14 03:00:10,779 INFO L226 Difference]: Without dead ends: 49237 [2022-07-14 03:00:10,903 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-14 03:00:10,904 INFO L413 NwaCegarLoop]: 3381 mSDtfsCounter, 1773 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 1178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 5516 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1178 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-14 03:00:10,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 5516 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1178 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-14 03:00:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49237 states. [2022-07-14 03:00:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49237 to 46699. [2022-07-14 03:00:13,335 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-14 03:00:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46699 states to 46699 states and 66496 transitions. [2022-07-14 03:00:13,575 INFO L78 Accepts]: Start accepts. Automaton has 46699 states and 66496 transitions. Word has length 270 [2022-07-14 03:00:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 03:00:13,575 INFO L495 AbstractCegarLoop]: Abstraction has 46699 states and 66496 transitions. [2022-07-14 03:00:13,576 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-14 03:00:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 46699 states and 66496 transitions. [2022-07-14 03:00:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-14 03:00:13,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 03:00:13,596 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-14 03:00:13,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 03:00:13,596 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-14 03:00:13,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 03:00:13,597 INFO L85 PathProgramCache]: Analyzing trace with hash 774055680, now seen corresponding path program 1 times [2022-07-14 03:00:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 03:00:13,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022229016] [2022-07-14 03:00:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 03:00:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 03:00:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 03:00:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 03:00:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 03:00:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 03:00:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 03:00:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 03:00:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 03:00:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 03:00:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 03:00:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 03:00:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 03:00:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 03:00:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 03:00:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 03:00:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 03:00:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 03:00:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 03:00:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 03:00:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-14 03:00:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 03:00:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-14 03:00:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-14 03:00:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 03:00:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-14 03:00:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-14 03:00:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 03:00:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 03:00:13,769 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-14 03:00:13,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 03:00:13,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022229016] [2022-07-14 03:00:13,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022229016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 03:00:13,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 03:00:13,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 03:00:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191381485] [2022-07-14 03:00:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 03:00:13,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 03:00:13,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 03:00:13,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 03:00:13,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 03:00:13,772 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-14 03:00:19,287 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-14 03:00:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 03:00:23,256 INFO L93 Difference]: Finished difference Result 101824 states and 145335 transitions. [2022-07-14 03:00:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 03:00:23,256 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-14 03:00:23,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 03:00:23,513 INFO L225 Difference]: With dead ends: 101824 [2022-07-14 03:00:23,514 INFO L226 Difference]: Without dead ends: 55193 [2022-07-14 03:00:23,921 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-14 03:00:23,925 INFO L413 NwaCegarLoop]: 3498 mSDtfsCounter, 1787 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 1161 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 5723 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-14 03:00:23,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 5723 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 2424 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-07-14 03:00:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55193 states.