./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-wan-farsync.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-wan-farsync.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 3dcd453e519a411dcaaa8ea095e5544a2fd8cdb9a31e662fc6de670ff7f7c541 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 15:21:37,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 15:21:37,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 15:21:37,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 15:21:37,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 15:21:37,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 15:21:37,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 15:21:37,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 15:21:37,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 15:21:37,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 15:21:37,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 15:21:37,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 15:21:37,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 15:21:37,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 15:21:37,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 15:21:37,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 15:21:37,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 15:21:37,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 15:21:37,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 15:21:37,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 15:21:37,863 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 15:21:37,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 15:21:37,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 15:21:37,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 15:21:37,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 15:21:37,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 15:21:37,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 15:21:37,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 15:21:37,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 15:21:37,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 15:21:37,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 15:21:37,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 15:21:37,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 15:21:37,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 15:21:37,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 15:21:37,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 15:21:37,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 15:21:37,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 15:21:37,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 15:21:37,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 15:21:37,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 15:21:37,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 15:21:37,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 15:21:37,916 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 15:21:37,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 15:21:37,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 15:21:37,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 15:21:37,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 15:21:37,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 15:21:37,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 15:21:37,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 15:21:37,919 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 15:21:37,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 15:21:37,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 15:21:37,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 15:21:37,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 15:21:37,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 15:21:37,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 15:21:37,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 15:21:37,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 15:21:37,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 15:21:37,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 15:21:37,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 15:21:37,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 15:21:37,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 15:21:37,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 15:21:37,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 15:21:37,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 15:21:37,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 15:21:37,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 15:21:37,924 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 15:21:37,924 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 15:21:37,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 15:21:37,925 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 -> 3dcd453e519a411dcaaa8ea095e5544a2fd8cdb9a31e662fc6de670ff7f7c541 [2022-07-12 15:21:38,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 15:21:38,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 15:21:38,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 15:21:38,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 15:21:38,216 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 15:21:38,217 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-wan-farsync.cil.i [2022-07-12 15:21:38,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b5dfb70/832e8eefdf0b4b01966a228070878cd1/FLAGc49f10604 [2022-07-12 15:21:39,014 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 15:21:39,015 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-wan-farsync.cil.i [2022-07-12 15:21:39,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b5dfb70/832e8eefdf0b4b01966a228070878cd1/FLAGc49f10604 [2022-07-12 15:21:39,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b5dfb70/832e8eefdf0b4b01966a228070878cd1 [2022-07-12 15:21:39,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 15:21:39,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 15:21:39,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 15:21:39,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 15:21:39,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 15:21:39,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:21:39" (1/1) ... [2022-07-12 15:21:39,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ec9e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:39, skipping insertion in model container [2022-07-12 15:21:39,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:21:39" (1/1) ... [2022-07-12 15:21:39,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 15:21:39,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 15:21:42,093 WARN L230 ndardFunctionHandler]: Function 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-wan-farsync.cil.i[320934,320947] [2022-07-12 15:21:42,096 WARN L230 ndardFunctionHandler]: Function 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-wan-farsync.cil.i[321103,321116] [2022-07-12 15:21:42,096 WARN L230 ndardFunctionHandler]: Function 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-wan-farsync.cil.i[321270,321283] [2022-07-12 15:21:42,097 WARN L230 ndardFunctionHandler]: Function 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-wan-farsync.cil.i[321438,321451] [2022-07-12 15:21:42,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 15:21:42,134 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 15:21:42,443 WARN L230 ndardFunctionHandler]: Function 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-wan-farsync.cil.i[320934,320947] [2022-07-12 15:21:42,443 WARN L230 ndardFunctionHandler]: Function 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-wan-farsync.cil.i[321103,321116] [2022-07-12 15:21:42,444 WARN L230 ndardFunctionHandler]: Function 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-wan-farsync.cil.i[321270,321283] [2022-07-12 15:21:42,445 WARN L230 ndardFunctionHandler]: Function 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-wan-farsync.cil.i[321438,321451] [2022-07-12 15:21:42,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 15:21:42,583 INFO L208 MainTranslator]: Completed translation [2022-07-12 15:21:42,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42 WrapperNode [2022-07-12 15:21:42,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 15:21:42,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 15:21:42,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 15:21:42,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 15:21:42,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:42,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:42,840 INFO L137 Inliner]: procedures = 418, calls = 1969, calls flagged for inlining = 195, calls inlined = 179, statements flattened = 5299 [2022-07-12 15:21:42,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 15:21:42,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 15:21:42,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 15:21:42,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 15:21:42,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:42,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:42,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:42,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:43,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:43,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:43,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:43,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 15:21:43,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 15:21:43,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 15:21:43,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 15:21:43,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (1/1) ... [2022-07-12 15:21:43,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 15:21:43,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 15:21:43,154 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-12 15:21:43,179 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-12 15:21:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-07-12 15:21:43,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-07-12 15:21:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-12 15:21:43,195 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-12 15:21:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 15:21:43,195 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 15:21:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-12 15:21:43,195 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-12 15:21:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 15:21:43,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 15:21:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure fst_remove_one [2022-07-12 15:21:43,196 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_remove_one [2022-07-12 15:21:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-12 15:21:43,196 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-12 15:21:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 15:21:43,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 15:21:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-07-12 15:21:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-07-12 15:21:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-07-12 15:21:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-07-12 15:21:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-07-12 15:21:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-07-12 15:21:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_61 [2022-07-12 15:21:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_61 [2022-07-12 15:21:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_67 [2022-07-12 15:21:43,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_67 [2022-07-12 15:21:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 15:21:43,198 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 15:21:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure fst_close [2022-07-12 15:21:43,198 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_close [2022-07-12 15:21:43,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 15:21:43,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 15:21:43,199 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-12 15:21:43,199 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-12 15:21:43,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 15:21:43,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 15:21:43,200 INFO L130 BoogieDeclarations]: Found specification of procedure fst_tx_timeout [2022-07-12 15:21:43,200 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_tx_timeout [2022-07-12 15:21:43,200 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 15:21:43,200 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 15:21:43,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 15:21:43,201 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-12 15:21:43,201 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-12 15:21:43,201 INFO L130 BoogieDeclarations]: Found specification of procedure fst_open [2022-07-12 15:21:43,201 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_open [2022-07-12 15:21:43,201 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_type_trans [2022-07-12 15:21:43,201 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_type_trans [2022-07-12 15:21:43,202 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 15:21:43,202 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 15:21:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 15:21:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 15:21:43,203 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 15:21:43,203 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 15:21:43,204 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 15:21:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 15:21:43,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 15:21:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 15:21:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 15:21:43,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 15:21:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 15:21:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-07-12 15:21:43,206 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-07-12 15:21:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 15:21:43,206 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 15:21:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure fst_issue_cmd [2022-07-12 15:21:43,207 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_issue_cmd [2022-07-12 15:21:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-12 15:21:43,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-12 15:21:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 15:21:43,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 15:21:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-12 15:21:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-12 15:21:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-12 15:21:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-12 15:21:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-12 15:21:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-12 15:21:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-12 15:21:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-12 15:21:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 15:21:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-07-12 15:21:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-07-12 15:21:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_2 [2022-07-12 15:21:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_2 [2022-07-12 15:21:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-07-12 15:21:43,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-07-12 15:21:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 15:21:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure fst_cpureset [2022-07-12 15:21:43,211 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_cpureset [2022-07-12 15:21:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 15:21:43,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 15:21:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 15:21:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 15:21:43,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 15:21:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 15:21:43,213 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 15:21:43,213 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 15:21:43,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 15:21:43,213 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-12 15:21:43,213 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-12 15:21:43,213 INFO L130 BoogieDeclarations]: Found specification of procedure fst_q_work_item [2022-07-12 15:21:43,213 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_q_work_item [2022-07-12 15:21:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-12 15:21:43,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-12 15:21:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 15:21:43,214 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 15:21:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 15:21:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 15:21:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-12 15:21:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-12 15:21:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-12 15:21:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-12 15:21:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-12 15:21:43,216 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-12 15:21:43,218 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-12 15:21:43,219 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-12 15:21:43,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 15:21:43,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 15:21:43,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 15:21:43,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 15:21:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 15:21:43,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 15:21:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 15:21:43,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 15:21:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-12 15:21:43,226 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-12 15:21:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 15:21:43,226 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 15:21:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 15:21:43,227 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 15:21:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2022-07-12 15:21:43,227 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2022-07-12 15:21:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 15:21:43,227 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 15:21:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 15:21:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure module_put [2022-07-12 15:21:43,227 INFO L138 BoogieDeclarations]: Found implementation of procedure module_put [2022-07-12 15:21:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 15:21:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-07-12 15:21:43,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-07-12 15:21:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 15:21:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 15:21:43,228 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 15:21:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 15:21:43,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 15:21:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-07-12 15:21:43,229 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-07-12 15:21:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-12 15:21:43,229 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-12 15:21:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 15:21:43,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 15:21:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-07-12 15:21:43,229 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-07-12 15:21:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-12 15:21:43,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-12 15:21:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure farsync_type_trans [2022-07-12 15:21:43,230 INFO L138 BoogieDeclarations]: Found implementation of procedure farsync_type_trans [2022-07-12 15:21:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 15:21:43,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 15:21:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 15:21:43,230 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 15:21:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_fst_work_q_lock [2022-07-12 15:21:43,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_fst_work_q_lock [2022-07-12 15:21:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 15:21:43,231 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 15:21:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 15:21:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure fst_disable_intr [2022-07-12 15:21:43,231 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_disable_intr [2022-07-12 15:21:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 15:21:43,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 15:21:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-12 15:21:43,232 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-12 15:21:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-12 15:21:43,232 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-12 15:21:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure do_bottom_half_tx [2022-07-12 15:21:43,232 INFO L138 BoogieDeclarations]: Found implementation of procedure do_bottom_half_tx [2022-07-12 15:21:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure fst_process_rx_status [2022-07-12 15:21:43,232 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_process_rx_status [2022-07-12 15:21:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 15:21:43,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 15:21:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-12 15:21:43,233 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-12 15:21:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_ioctl [2022-07-12 15:21:43,234 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_ioctl [2022-07-12 15:21:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-12 15:21:43,234 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-12 15:21:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-12 15:21:43,234 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-12 15:21:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-07-12 15:21:43,235 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-07-12 15:21:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure fst_clear_intr [2022-07-12 15:21:43,235 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_clear_intr [2022-07-12 15:21:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 15:21:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-12 15:21:43,235 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-12 15:21:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-12 15:21:43,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-12 15:21:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-12 15:21:43,236 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-12 15:21:44,026 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 15:21:44,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 15:21:44,119 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 15:21:47,703 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-12 15:21:47,814 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 15:21:47,839 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 15:21:47,840 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 15:21:47,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:21:47 BoogieIcfgContainer [2022-07-12 15:21:47,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 15:21:47,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 15:21:47,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 15:21:47,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 15:21:47,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:21:39" (1/3) ... [2022-07-12 15:21:47,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dc1f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:21:47, skipping insertion in model container [2022-07-12 15:21:47,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:21:42" (2/3) ... [2022-07-12 15:21:47,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dc1f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:21:47, skipping insertion in model container [2022-07-12 15:21:47,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:21:47" (3/3) ... [2022-07-12 15:21:47,855 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-07-12 15:21:47,870 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 15:21:47,870 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 15:21:47,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 15:21:47,987 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@7e68de3b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31e340f4 [2022-07-12 15:21:47,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 15:21:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 1862 states, 1281 states have (on average 1.3036690085870413) internal successors, (1670), 1295 states have internal predecessors, (1670), 488 states have call successors, (488), 91 states have call predecessors, (488), 90 states have return successors, (481), 479 states have call predecessors, (481), 481 states have call successors, (481) [2022-07-12 15:21:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 15:21:48,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:48,015 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:21:48,016 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-12 15:21:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1565129519, now seen corresponding path program 1 times [2022-07-12 15:21:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:48,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314898725] [2022-07-12 15:21:48,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 15:21:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 15:21:48,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:48,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314898725] [2022-07-12 15:21:48,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314898725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:48,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:48,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71095940] [2022-07-12 15:21:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:48,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:48,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:48,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:48,747 INFO L87 Difference]: Start difference. First operand has 1862 states, 1281 states have (on average 1.3036690085870413) internal successors, (1670), 1295 states have internal predecessors, (1670), 488 states have call successors, (488), 91 states have call predecessors, (488), 90 states have return successors, (481), 479 states have call predecessors, (481), 481 states have call successors, (481) 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 15:21:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:53,808 INFO L93 Difference]: Finished difference Result 5468 states and 7881 transitions. [2022-07-12 15:21:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:53,811 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-07-12 15:21:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:53,851 INFO L225 Difference]: With dead ends: 5468 [2022-07-12 15:21:53,852 INFO L226 Difference]: Without dead ends: 3610 [2022-07-12 15:21:53,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-12 15:21:53,867 INFO L413 NwaCegarLoop]: 2785 mSDtfsCounter, 3022 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 1338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3464 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1338 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:53,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3464 Valid, 5269 Invalid, 3472 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1338 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-12 15:21:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2022-07-12 15:21:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 3588. [2022-07-12 15:21:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 2487 states have (on average 1.2903096099718536) internal successors, (3209), 2514 states have internal predecessors, (3209), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) [2022-07-12 15:21:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5049 transitions. [2022-07-12 15:21:54,147 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5049 transitions. Word has length 83 [2022-07-12 15:21:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:54,148 INFO L495 AbstractCegarLoop]: Abstraction has 3588 states and 5049 transitions. [2022-07-12 15:21:54,149 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 15:21:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5049 transitions. [2022-07-12 15:21:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 15:21:54,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:54,159 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:54,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 15:21:54,161 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-12 15:21:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash -401151663, now seen corresponding path program 1 times [2022-07-12 15:21:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:54,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852950719] [2022-07-12 15:21:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 15:21:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 15:21:54,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:54,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852950719] [2022-07-12 15:21:54,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852950719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:54,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:54,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 15:21:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714103738] [2022-07-12 15:21:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:54,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 15:21:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:54,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 15:21:54,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 15:21:54,424 INFO L87 Difference]: Start difference. First operand 3588 states and 5049 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 15:22:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:01,684 INFO L93 Difference]: Finished difference Result 9274 states and 13077 transitions. [2022-07-12 15:22:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 15:22:01,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-07-12 15:22:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:01,722 INFO L225 Difference]: With dead ends: 9274 [2022-07-12 15:22:01,722 INFO L226 Difference]: Without dead ends: 5701 [2022-07-12 15:22:01,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-12 15:22:01,738 INFO L413 NwaCegarLoop]: 2998 mSDtfsCounter, 6388 mSDsluCounter, 3800 mSDsCounter, 0 mSdLazyCounter, 5760 mSolverCounterSat, 2497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7250 SdHoareTripleChecker+Valid, 6798 SdHoareTripleChecker+Invalid, 8257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2497 IncrementalHoareTripleChecker+Valid, 5760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:01,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7250 Valid, 6798 Invalid, 8257 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2497 Valid, 5760 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-12 15:22:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2022-07-12 15:22:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5632. [2022-07-12 15:22:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5632 states, 3938 states have (on average 1.298374809547994) internal successors, (5113), 3981 states have internal predecessors, (5113), 1401 states have call successors, (1401), 293 states have call predecessors, (1401), 290 states have return successors, (1397), 1385 states have call predecessors, (1397), 1397 states have call successors, (1397) [2022-07-12 15:22:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7911 transitions. [2022-07-12 15:22:02,005 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7911 transitions. Word has length 93 [2022-07-12 15:22:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:02,006 INFO L495 AbstractCegarLoop]: Abstraction has 5632 states and 7911 transitions. [2022-07-12 15:22:02,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 15:22:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7911 transitions. [2022-07-12 15:22:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 15:22:02,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:02,008 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:22:02,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 15:22:02,009 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-12 15:22:02,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:02,009 INFO L85 PathProgramCache]: Analyzing trace with hash -480453640, now seen corresponding path program 1 times [2022-07-12 15:22:02,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:02,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206070707] [2022-07-12 15:22:02,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:02,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 15:22:02,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:02,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206070707] [2022-07-12 15:22:02,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206070707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:02,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:02,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:22:02,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088790205] [2022-07-12 15:22:02,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:02,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:22:02,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:22:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:22:02,258 INFO L87 Difference]: Start difference. First operand 5632 states and 7911 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 15:22:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:06,445 INFO L93 Difference]: Finished difference Result 15171 states and 21240 transitions. [2022-07-12 15:22:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:22:06,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-07-12 15:22:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:06,497 INFO L225 Difference]: With dead ends: 15171 [2022-07-12 15:22:06,498 INFO L226 Difference]: Without dead ends: 9554 [2022-07-12 15:22:06,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-12 15:22:06,523 INFO L413 NwaCegarLoop]: 2736 mSDtfsCounter, 2872 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 1368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3281 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1368 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:06,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3281 Valid, 5205 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1368 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 15:22:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9554 states. [2022-07-12 15:22:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9554 to 9494. [2022-07-12 15:22:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9494 states, 6640 states have (on average 1.2884036144578312) internal successors, (8555), 6720 states have internal predecessors, (8555), 2330 states have call successors, (2330), 526 states have call predecessors, (2330), 521 states have return successors, (2326), 2293 states have call predecessors, (2326), 2326 states have call successors, (2326) [2022-07-12 15:22:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 13211 transitions. [2022-07-12 15:22:07,004 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 13211 transitions. Word has length 91 [2022-07-12 15:22:07,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:07,005 INFO L495 AbstractCegarLoop]: Abstraction has 9494 states and 13211 transitions. [2022-07-12 15:22:07,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 15:22:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 13211 transitions. [2022-07-12 15:22:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 15:22:07,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:07,009 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:22:07,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 15:22:07,010 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-12 15:22:07,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1794242578, now seen corresponding path program 1 times [2022-07-12 15:22:07,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:07,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942067544] [2022-07-12 15:22:07,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:07,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:22:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 15:22:07,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:07,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942067544] [2022-07-12 15:22:07,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942067544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:07,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:07,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:22:07,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533679972] [2022-07-12 15:22:07,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:07,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:22:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:07,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:22:07,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:22:07,202 INFO L87 Difference]: Start difference. First operand 9494 states and 13211 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 15:22:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:11,091 INFO L93 Difference]: Finished difference Result 23931 states and 33124 transitions. [2022-07-12 15:22:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:22:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2022-07-12 15:22:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:11,191 INFO L225 Difference]: With dead ends: 23931 [2022-07-12 15:22:11,191 INFO L226 Difference]: Without dead ends: 14452 [2022-07-12 15:22:11,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-12 15:22:11,231 INFO L413 NwaCegarLoop]: 2683 mSDtfsCounter, 2519 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 1263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 5175 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1263 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:11,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2868 Valid, 5175 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1263 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 15:22:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2022-07-12 15:22:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14372. [2022-07-12 15:22:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14372 states, 10037 states have (on average 1.2834512304473449) internal successors, (12882), 10172 states have internal predecessors, (12882), 3450 states have call successors, (3450), 891 states have call predecessors, (3450), 882 states have return successors, (3452), 3371 states have call predecessors, (3452), 3446 states have call successors, (3452) [2022-07-12 15:22:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14372 states to 14372 states and 19784 transitions. [2022-07-12 15:22:11,911 INFO L78 Accepts]: Start accepts. Automaton has 14372 states and 19784 transitions. Word has length 95 [2022-07-12 15:22:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:11,912 INFO L495 AbstractCegarLoop]: Abstraction has 14372 states and 19784 transitions. [2022-07-12 15:22:11,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 15:22:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 14372 states and 19784 transitions. [2022-07-12 15:22:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 15:22:11,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:11,919 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:22:11,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 15:22:11,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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-12 15:22:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash 606465146, now seen corresponding path program 1 times [2022-07-12 15:22:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:11,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427825225] [2022-07-12 15:22:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 15:22:12,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:12,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427825225] [2022-07-12 15:22:12,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427825225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:12,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:12,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:22:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50705692] [2022-07-12 15:22:12,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:12,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:22:12,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:12,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:22:12,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:22:12,099 INFO L87 Difference]: Start difference. First operand 14372 states and 19784 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 15:22:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:16,275 INFO L93 Difference]: Finished difference Result 41500 states and 57060 transitions. [2022-07-12 15:22:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:22:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2022-07-12 15:22:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:16,395 INFO L225 Difference]: With dead ends: 41500 [2022-07-12 15:22:16,396 INFO L226 Difference]: Without dead ends: 27143 [2022-07-12 15:22:16,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-12 15:22:16,444 INFO L413 NwaCegarLoop]: 3016 mSDtfsCounter, 2918 mSDsluCounter, 2600 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3352 SdHoareTripleChecker+Valid, 5616 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:16,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3352 Valid, 5616 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1331 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 15:22:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27143 states. [2022-07-12 15:22:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27143 to 26997. [2022-07-12 15:22:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26997 states, 18896 states have (on average 1.2753492802709567) internal successors, (24099), 19168 states have internal predecessors, (24099), 6410 states have call successors, (6410), 1705 states have call predecessors, (6410), 1688 states have return successors, (6418), 6241 states have call predecessors, (6418), 6406 states have call successors, (6418) [2022-07-12 15:22:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26997 states to 26997 states and 36927 transitions. [2022-07-12 15:22:17,577 INFO L78 Accepts]: Start accepts. Automaton has 26997 states and 36927 transitions. Word has length 92 [2022-07-12 15:22:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:17,579 INFO L495 AbstractCegarLoop]: Abstraction has 26997 states and 36927 transitions. [2022-07-12 15:22:17,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 15:22:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 26997 states and 36927 transitions. [2022-07-12 15:22:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 15:22:17,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:17,581 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:22:17,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 15:22:17,581 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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-12 15:22:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1444009632, now seen corresponding path program 1 times [2022-07-12 15:22:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:17,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954072279] [2022-07-12 15:22:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:22:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 15:22:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:22:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:22:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-12 15:22:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:17,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954072279] [2022-07-12 15:22:17,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954072279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:17,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:17,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:22:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928206135] [2022-07-12 15:22:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:22:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:22:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:22:17,808 INFO L87 Difference]: Start difference. First operand 26997 states and 36927 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 15:22:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:22,233 INFO L93 Difference]: Finished difference Result 75036 states and 102616 transitions. [2022-07-12 15:22:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:22:22,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2022-07-12 15:22:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:22,607 INFO L225 Difference]: With dead ends: 75036 [2022-07-12 15:22:22,607 INFO L226 Difference]: Without dead ends: 48054 [2022-07-12 15:22:22,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-12 15:22:22,683 INFO L413 NwaCegarLoop]: 3356 mSDtfsCounter, 2733 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 1219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 6216 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1219 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:22,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 6216 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1219 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 15:22:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48054 states. [2022-07-12 15:22:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48054 to 47812. [2022-07-12 15:22:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47812 states, 33395 states have (on average 1.2702799820332384) internal successors, (42421), 33945 states have internal predecessors, (42421), 11412 states have call successors, (11412), 3067 states have call predecessors, (11412), 3002 states have return successors, (11440), 11019 states have call predecessors, (11440), 11408 states have call successors, (11440) [2022-07-12 15:22:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47812 states to 47812 states and 65273 transitions. [2022-07-12 15:22:24,659 INFO L78 Accepts]: Start accepts. Automaton has 47812 states and 65273 transitions. Word has length 108 [2022-07-12 15:22:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:24,659 INFO L495 AbstractCegarLoop]: Abstraction has 47812 states and 65273 transitions. [2022-07-12 15:22:24,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 15:22:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 47812 states and 65273 transitions. [2022-07-12 15:22:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 15:22:24,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:24,662 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-12 15:22:24,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 15:22:24,663 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-12 15:22:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1186239737, now seen corresponding path program 1 times [2022-07-12 15:22:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:24,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797295712] [2022-07-12 15:22:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:22:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 15:22:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 15:22:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 15:22:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 15:22:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:22:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:25,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 15:22:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:25,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 15:22:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:25,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:22:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-12 15:22:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:25,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797295712] [2022-07-12 15:22:25,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797295712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:25,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:25,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:22:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253635304] [2022-07-12 15:22:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:25,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:22:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:25,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:22:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:22:25,137 INFO L87 Difference]: Start difference. First operand 47812 states and 65273 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 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-12 15:22:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:28,459 INFO L93 Difference]: Finished difference Result 95820 states and 130864 transitions. [2022-07-12 15:22:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 15:22:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 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 150 [2022-07-12 15:22:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:28,684 INFO L225 Difference]: With dead ends: 95820 [2022-07-12 15:22:28,684 INFO L226 Difference]: Without dead ends: 48100 [2022-07-12 15:22:28,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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-12 15:22:28,820 INFO L413 NwaCegarLoop]: 2443 mSDtfsCounter, 551 mSDsluCounter, 2505 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 4948 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:28,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 4948 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 15:22:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48100 states. [2022-07-12 15:22:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48100 to 47860. [2022-07-12 15:22:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47860 states, 33443 states have (on average 1.269892055138594) internal successors, (42469), 33993 states have internal predecessors, (42469), 11412 states have call successors, (11412), 3067 states have call predecessors, (11412), 3002 states have return successors, (11440), 11019 states have call predecessors, (11440), 11408 states have call successors, (11440) [2022-07-12 15:22:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47860 states to 47860 states and 65321 transitions. [2022-07-12 15:22:30,882 INFO L78 Accepts]: Start accepts. Automaton has 47860 states and 65321 transitions. Word has length 150 [2022-07-12 15:22:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:30,883 INFO L495 AbstractCegarLoop]: Abstraction has 47860 states and 65321 transitions. [2022-07-12 15:22:30,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 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-12 15:22:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 47860 states and 65321 transitions. [2022-07-12 15:22:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 15:22:30,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:30,886 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-12 15:22:30,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 15:22:30,886 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-12 15:22:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1165995741, now seen corresponding path program 1 times [2022-07-12 15:22:30,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:30,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171505514] [2022-07-12 15:22:30,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:22:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 15:22:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 15:22:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:22:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:22:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 15:22:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 15:22:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 15:22:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 15:22:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-12 15:22:31,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:31,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171505514] [2022-07-12 15:22:31,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171505514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 15:22:31,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834148331] [2022-07-12 15:22:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:31,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 15:22:31,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 15:22:31,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 15:22:31,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 15:22:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:31,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 15:22:32,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 15:22:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-12 15:22:32,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 15:22:32,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834148331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:32,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 15:22:32,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-12 15:22:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110277274] [2022-07-12 15:22:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 15:22:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:32,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 15:22:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:32,045 INFO L87 Difference]: Start difference. First operand 47860 states and 65321 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 15:22:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:33,784 INFO L93 Difference]: Finished difference Result 103050 states and 140745 transitions. [2022-07-12 15:22:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 15:22:33,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2022-07-12 15:22:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:34,045 INFO L225 Difference]: With dead ends: 103050 [2022-07-12 15:22:34,045 INFO L226 Difference]: Without dead ends: 55282 [2022-07-12 15:22:34,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:34,175 INFO L413 NwaCegarLoop]: 3167 mSDtfsCounter, 2531 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2531 SdHoareTripleChecker+Valid, 5289 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:34,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2531 Valid, 5289 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 15:22:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55282 states. [2022-07-12 15:22:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55282 to 55259. [2022-07-12 15:22:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55259 states, 38803 states have (on average 1.2701852949514212) internal successors, (49287), 39353 states have internal predecessors, (49287), 13038 states have call successors, (13038), 3488 states have call predecessors, (13038), 3415 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-12 15:22:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55259 states to 55259 states and 75399 transitions. [2022-07-12 15:22:36,176 INFO L78 Accepts]: Start accepts. Automaton has 55259 states and 75399 transitions. Word has length 152 [2022-07-12 15:22:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:36,177 INFO L495 AbstractCegarLoop]: Abstraction has 55259 states and 75399 transitions. [2022-07-12 15:22:36,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 15:22:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 55259 states and 75399 transitions. [2022-07-12 15:22:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 15:22:36,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:36,179 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-12 15:22:36,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 15:22:36,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 15:22:36,384 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-12 15:22:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1025447131, now seen corresponding path program 1 times [2022-07-12 15:22:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:36,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26287112] [2022-07-12 15:22:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:36,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:22:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 15:22:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 15:22:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:22:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:22:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 15:22:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 15:22:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 15:22:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 15:22:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-12 15:22:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:36,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26287112] [2022-07-12 15:22:36,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26287112] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 15:22:36,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153694769] [2022-07-12 15:22:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:36,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 15:22:36,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 15:22:36,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 15:22:36,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 15:22:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:37,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 15:22:37,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 15:22:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-12 15:22:37,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 15:22:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-12 15:22:37,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153694769] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 15:22:37,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 15:22:37,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-07-12 15:22:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637738076] [2022-07-12 15:22:37,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 15:22:37,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 15:22:37,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 15:22:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 15:22:37,388 INFO L87 Difference]: Start difference. First operand 55259 states and 75399 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 15:22:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:42,798 INFO L93 Difference]: Finished difference Result 110734 states and 151134 transitions. [2022-07-12 15:22:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 152 [2022-07-12 15:22:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:43,054 INFO L225 Difference]: With dead ends: 110734 [2022-07-12 15:22:43,054 INFO L226 Difference]: Without dead ends: 55567 [2022-07-12 15:22:43,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 15:22:43,226 INFO L413 NwaCegarLoop]: 2443 mSDtfsCounter, 556 mSDsluCounter, 6879 mSDsCounter, 0 mSdLazyCounter, 5088 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 9322 SdHoareTripleChecker+Invalid, 5570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 5088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:43,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 9322 Invalid, 5570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 5088 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 15:22:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55567 states. [2022-07-12 15:22:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55567 to 55331. [2022-07-12 15:22:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55331 states, 38875 states have (on average 1.269684887459807) internal successors, (49359), 39425 states have internal predecessors, (49359), 13038 states have call successors, (13038), 3488 states have call predecessors, (13038), 3415 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-12 15:22:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55331 states to 55331 states and 75471 transitions. [2022-07-12 15:22:45,020 INFO L78 Accepts]: Start accepts. Automaton has 55331 states and 75471 transitions. Word has length 152 [2022-07-12 15:22:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:45,021 INFO L495 AbstractCegarLoop]: Abstraction has 55331 states and 75471 transitions. [2022-07-12 15:22:45,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 15:22:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 55331 states and 75471 transitions. [2022-07-12 15:22:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 15:22:45,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:45,024 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-07-12 15:22:45,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 15:22:45,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 15:22:45,240 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-12 15:22:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 686822265, now seen corresponding path program 2 times [2022-07-12 15:22:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:45,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88016442] [2022-07-12 15:22:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:22:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 15:22:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:22:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:22:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:22:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:22:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:22:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:22:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:22:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-07-12 15:22:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:45,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88016442] [2022-07-12 15:22:45,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88016442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:45,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:45,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547306834] [2022-07-12 15:22:45,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:45,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:45,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:45,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:45,816 INFO L87 Difference]: Start difference. First operand 55331 states and 75471 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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-12 15:22:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:50,212 INFO L93 Difference]: Finished difference Result 55573 states and 75807 transitions. [2022-07-12 15:22:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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 158 [2022-07-12 15:22:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:50,560 INFO L225 Difference]: With dead ends: 55573 [2022-07-12 15:22:50,560 INFO L226 Difference]: Without dead ends: 55571 [2022-07-12 15:22:50,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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-12 15:22:50,590 INFO L413 NwaCegarLoop]: 2442 mSDtfsCounter, 2520 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2819 SdHoareTripleChecker+Valid, 6415 SdHoareTripleChecker+Invalid, 3722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 921 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:50,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2819 Valid, 6415 Invalid, 3722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [921 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 15:22:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55571 states. [2022-07-12 15:22:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55571 to 55335. [2022-07-12 15:22:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55335 states, 38878 states have (on average 1.269664077370235) internal successors, (49362), 39428 states have internal predecessors, (49362), 13038 states have call successors, (13038), 3489 states have call predecessors, (13038), 3416 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-12 15:22:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55335 states to 55335 states and 75474 transitions. [2022-07-12 15:22:52,391 INFO L78 Accepts]: Start accepts. Automaton has 55335 states and 75474 transitions. Word has length 158 [2022-07-12 15:22:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:52,392 INFO L495 AbstractCegarLoop]: Abstraction has 55335 states and 75474 transitions. [2022-07-12 15:22:52,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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-12 15:22:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 55335 states and 75474 transitions. [2022-07-12 15:22:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 15:22:52,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:52,395 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-07-12 15:22:52,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 15:22:52,396 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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-12 15:22:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash -296417503, now seen corresponding path program 1 times [2022-07-12 15:22:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:52,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682795237] [2022-07-12 15:22:52,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:22:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 15:22:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:22:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:22:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:22:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:22:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:22:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:22:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:22:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 15:22:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-07-12 15:22:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:52,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682795237] [2022-07-12 15:22:52,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682795237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:52,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:52,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787830596] [2022-07-12 15:22:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:52,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:52,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:52,698 INFO L87 Difference]: Start difference. First operand 55335 states and 75474 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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-12 15:22:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:56,652 INFO L93 Difference]: Finished difference Result 55577 states and 75810 transitions. [2022-07-12 15:22:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:56,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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 163 [2022-07-12 15:22:56,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:56,855 INFO L225 Difference]: With dead ends: 55577 [2022-07-12 15:22:56,855 INFO L226 Difference]: Without dead ends: 55575 [2022-07-12 15:22:56,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 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-12 15:22:56,890 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2512 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2811 SdHoareTripleChecker+Valid, 6418 SdHoareTripleChecker+Invalid, 3721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:56,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 6418 Invalid, 3721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-12 15:22:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55575 states. [2022-07-12 15:22:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55575 to 55339. [2022-07-12 15:22:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55339 states, 38881 states have (on average 1.2696432704920142) internal successors, (49365), 39431 states have internal predecessors, (49365), 13038 states have call successors, (13038), 3490 states have call predecessors, (13038), 3417 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-12 15:22:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55339 states to 55339 states and 75477 transitions. [2022-07-12 15:22:58,767 INFO L78 Accepts]: Start accepts. Automaton has 55339 states and 75477 transitions. Word has length 163 [2022-07-12 15:22:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:58,768 INFO L495 AbstractCegarLoop]: Abstraction has 55339 states and 75477 transitions. [2022-07-12 15:22:58,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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-12 15:22:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 55339 states and 75477 transitions. [2022-07-12 15:22:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 15:22:58,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:58,772 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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] [2022-07-12 15:22:58,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 15:22:58,772 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-12 15:22:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1344588743, now seen corresponding path program 1 times [2022-07-12 15:22:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:58,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821507304] [2022-07-12 15:22:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:22:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 15:22:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:22:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:22:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:58,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:22:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:59,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:22:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:59,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:22:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:22:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:22:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 15:22:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 15:22:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-12 15:22:59,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821507304] [2022-07-12 15:22:59,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821507304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:59,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:59,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346479683] [2022-07-12 15:22:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:59,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:59,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:59,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:59,052 INFO L87 Difference]: Start difference. First operand 55339 states and 75477 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 15:23:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:03,290 INFO L93 Difference]: Finished difference Result 55581 states and 75813 transitions. [2022-07-12 15:23:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:23:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2022-07-12 15:23:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:03,487 INFO L225 Difference]: With dead ends: 55581 [2022-07-12 15:23:03,488 INFO L226 Difference]: Without dead ends: 55579 [2022-07-12 15:23:03,522 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-12 15:23:03,522 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2512 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 919 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2811 SdHoareTripleChecker+Valid, 6418 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 919 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:03,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 6418 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [919 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 15:23:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55579 states. [2022-07-12 15:23:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55579 to 55343. [2022-07-12 15:23:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55343 states, 38884 states have (on average 1.2696224668244007) internal successors, (49368), 39434 states have internal predecessors, (49368), 13038 states have call successors, (13038), 3491 states have call predecessors, (13038), 3418 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-12 15:23:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55343 states to 55343 states and 75480 transitions. [2022-07-12 15:23:05,565 INFO L78 Accepts]: Start accepts. Automaton has 55343 states and 75480 transitions. Word has length 168 [2022-07-12 15:23:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:05,566 INFO L495 AbstractCegarLoop]: Abstraction has 55343 states and 75480 transitions. [2022-07-12 15:23:05,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 15:23:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 55343 states and 75480 transitions. [2022-07-12 15:23:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-12 15:23:05,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:05,569 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-12 15:23:05,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 15:23:05,570 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-12 15:23:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash -449147423, now seen corresponding path program 1 times [2022-07-12 15:23:05,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:05,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984525073] [2022-07-12 15:23:05,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:23:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 15:23:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:23:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:23:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:23:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:23:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:23:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:23:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:23:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 15:23:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 15:23:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 15:23:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-07-12 15:23:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:05,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984525073] [2022-07-12 15:23:05,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984525073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:05,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:05,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:23:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543332935] [2022-07-12 15:23:05,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:05,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:23:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:05,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:23:05,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:23:05,872 INFO L87 Difference]: Start difference. First operand 55343 states and 75480 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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-12 15:23:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:10,392 INFO L93 Difference]: Finished difference Result 56667 states and 76617 transitions. [2022-07-12 15:23:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 15:23:10,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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 173 [2022-07-12 15:23:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:10,595 INFO L225 Difference]: With dead ends: 56667 [2022-07-12 15:23:10,595 INFO L226 Difference]: Without dead ends: 56665 [2022-07-12 15:23:10,625 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-12 15:23:10,625 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 2468 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 6443 SdHoareTripleChecker+Invalid, 3792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:10,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 6443 Invalid, 3792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 15:23:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56665 states. [2022-07-12 15:23:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56665 to 56427. [2022-07-12 15:23:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56427 states, 39641 states have (on average 1.2656340657400167) internal successors, (50171), 40191 states have internal predecessors, (50171), 13038 states have call successors, (13038), 3818 states have call predecessors, (13038), 3745 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-12 15:23:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56427 states to 56427 states and 76283 transitions. [2022-07-12 15:23:12,827 INFO L78 Accepts]: Start accepts. Automaton has 56427 states and 76283 transitions. Word has length 173 [2022-07-12 15:23:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:12,827 INFO L495 AbstractCegarLoop]: Abstraction has 56427 states and 76283 transitions. [2022-07-12 15:23:12,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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-12 15:23:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 56427 states and 76283 transitions. [2022-07-12 15:23:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-12 15:23:12,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:12,831 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2022-07-12 15:23:12,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 15:23:12,831 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-12 15:23:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash -724162530, now seen corresponding path program 1 times [2022-07-12 15:23:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:12,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840612887] [2022-07-12 15:23:12,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:23:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 15:23:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:23:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:23:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:23:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:23:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:23:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:23:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 15:23:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:23:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 15:23:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 15:23:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 15:23:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 15:23:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 15:23:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-12 15:23:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:13,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840612887] [2022-07-12 15:23:13,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840612887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:13,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:13,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:23:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185299705] [2022-07-12 15:23:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:13,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:23:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:23:13,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:23:13,085 INFO L87 Difference]: Start difference. First operand 56427 states and 76283 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 15:23:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:19,816 INFO L93 Difference]: Finished difference Result 112625 states and 152225 transitions. [2022-07-12 15:23:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 15:23:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2022-07-12 15:23:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:20,036 INFO L225 Difference]: With dead ends: 112625 [2022-07-12 15:23:20,036 INFO L226 Difference]: Without dead ends: 66234 [2022-07-12 15:23:20,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 15:23:20,126 INFO L413 NwaCegarLoop]: 2818 mSDtfsCounter, 3539 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 2480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3795 SdHoareTripleChecker+Valid, 6257 SdHoareTripleChecker+Invalid, 5383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2480 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:20,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3795 Valid, 6257 Invalid, 5383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2480 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 15:23:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66234 states. [2022-07-12 15:23:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66234 to 65950. [2022-07-12 15:23:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65950 states, 46426 states have (on average 1.2609098350062464) internal successors, (58539), 47036 states have internal predecessors, (58539), 15060 states have call successors, (15060), 4542 states have call predecessors, (15060), 4461 states have return successors, (15104), 14671 states have call predecessors, (15104), 15056 states have call successors, (15104) [2022-07-12 15:23:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65950 states to 65950 states and 88703 transitions. [2022-07-12 15:23:22,591 INFO L78 Accepts]: Start accepts. Automaton has 65950 states and 88703 transitions. Word has length 189 [2022-07-12 15:23:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:22,592 INFO L495 AbstractCegarLoop]: Abstraction has 65950 states and 88703 transitions. [2022-07-12 15:23:22,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 15:23:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 65950 states and 88703 transitions. [2022-07-12 15:23:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-12 15:23:22,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:22,599 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2022-07-12 15:23:22,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 15:23:22,599 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-12 15:23:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash -683487780, now seen corresponding path program 1 times [2022-07-12 15:23:22,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:22,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455934943] [2022-07-12 15:23:22,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:23:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 15:23:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:23:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:23:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:23:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:23:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:23:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:23:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 15:23:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:23:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 15:23:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 15:23:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 15:23:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 15:23:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 15:23:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-12 15:23:22,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:22,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455934943] [2022-07-12 15:23:22,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455934943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:22,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:22,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:23:22,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681695455] [2022-07-12 15:23:22,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:22,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:23:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:23:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:23:22,789 INFO L87 Difference]: Start difference. First operand 65950 states and 88703 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 15:23:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:29,303 INFO L93 Difference]: Finished difference Result 131536 states and 177042 transitions. [2022-07-12 15:23:29,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 15:23:29,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2022-07-12 15:23:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:29,529 INFO L225 Difference]: With dead ends: 131536 [2022-07-12 15:23:29,529 INFO L226 Difference]: Without dead ends: 65678 [2022-07-12 15:23:29,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 15:23:29,669 INFO L413 NwaCegarLoop]: 4329 mSDtfsCounter, 2702 mSDsluCounter, 4796 mSDsCounter, 0 mSdLazyCounter, 3069 mSolverCounterSat, 1863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2957 SdHoareTripleChecker+Valid, 9125 SdHoareTripleChecker+Invalid, 4932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1863 IncrementalHoareTripleChecker+Valid, 3069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:29,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2957 Valid, 9125 Invalid, 4932 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1863 Valid, 3069 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 15:23:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65678 states. [2022-07-12 15:23:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65678 to 65359. [2022-07-12 15:23:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65359 states, 45994 states have (on average 1.2608383702222028) internal successors, (57991), 46596 states have internal predecessors, (57991), 14953 states have call successors, (14953), 4490 states have call predecessors, (14953), 4409 states have return successors, (14997), 14572 states have call predecessors, (14997), 14949 states have call successors, (14997) [2022-07-12 15:23:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65359 states to 65359 states and 87941 transitions. [2022-07-12 15:23:32,163 INFO L78 Accepts]: Start accepts. Automaton has 65359 states and 87941 transitions. Word has length 189 [2022-07-12 15:23:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:32,164 INFO L495 AbstractCegarLoop]: Abstraction has 65359 states and 87941 transitions. [2022-07-12 15:23:32,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 15:23:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 65359 states and 87941 transitions. [2022-07-12 15:23:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-12 15:23:32,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:32,168 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 15:23:32,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 15:23:32,168 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-12 15:23:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:32,169 INFO L85 PathProgramCache]: Analyzing trace with hash 827725049, now seen corresponding path program 1 times [2022-07-12 15:23:32,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:32,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624036366] [2022-07-12 15:23:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:32,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:23:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 15:23:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:23:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:23:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:23:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:23:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:23:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:23:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:23:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 15:23:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 15:23:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 15:23:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 15:23:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-07-12 15:23:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:32,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624036366] [2022-07-12 15:23:32,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624036366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:32,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:32,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:23:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854285041] [2022-07-12 15:23:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:32,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:23:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:23:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:23:32,394 INFO L87 Difference]: Start difference. First operand 65359 states and 87941 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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-12 15:23:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:36,939 INFO L93 Difference]: Finished difference Result 65863 states and 88494 transitions. [2022-07-12 15:23:36,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 15:23:36,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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 178 [2022-07-12 15:23:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:37,107 INFO L225 Difference]: With dead ends: 65863 [2022-07-12 15:23:37,107 INFO L226 Difference]: Without dead ends: 65861 [2022-07-12 15:23:37,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 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-12 15:23:37,131 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2511 mSDsluCounter, 3979 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2806 SdHoareTripleChecker+Valid, 6424 SdHoareTripleChecker+Invalid, 3737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:37,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2806 Valid, 6424 Invalid, 3737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-12 15:23:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65861 states. [2022-07-12 15:23:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65861 to 65579. [2022-07-12 15:23:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65579 states, 46159 states have (on average 1.2599059771658832) internal successors, (58156), 46761 states have internal predecessors, (58156), 14953 states have call successors, (14953), 4545 states have call predecessors, (14953), 4464 states have return successors, (14997), 14572 states have call predecessors, (14997), 14949 states have call successors, (14997) [2022-07-12 15:23:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65579 states to 65579 states and 88106 transitions. [2022-07-12 15:23:39,770 INFO L78 Accepts]: Start accepts. Automaton has 65579 states and 88106 transitions. Word has length 178 [2022-07-12 15:23:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:39,771 INFO L495 AbstractCegarLoop]: Abstraction has 65579 states and 88106 transitions. [2022-07-12 15:23:39,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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-12 15:23:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 65579 states and 88106 transitions. [2022-07-12 15:23:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 15:23:39,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:39,775 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-07-12 15:23:39,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 15:23:39,776 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-12 15:23:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -983018335, now seen corresponding path program 1 times [2022-07-12 15:23:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:39,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289333106] [2022-07-12 15:23:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:23:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 15:23:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:23:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 15:23:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:23:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:23:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:23:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:39,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:23:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:23:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 15:23:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 15:23:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 15:23:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 15:23:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 15:23:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-12 15:23:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289333106] [2022-07-12 15:23:40,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289333106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:40,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:40,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:23:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647804752] [2022-07-12 15:23:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:40,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:23:40,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:40,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:23:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:23:40,035 INFO L87 Difference]: Start difference. First operand 65579 states and 88106 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)