./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-irda-via-ircc.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-irda-via-ircc.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 67e7778ced54570c612880d3f2f5d48e6e2d3dc55afd632628e45d31cdc74c58 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 15:20:55,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 15:20:55,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 15:20:55,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 15:20:55,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 15:20:55,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 15:20:55,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 15:20:55,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 15:20:55,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 15:20:55,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 15:20:55,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 15:20:55,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 15:20:55,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 15:20:55,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 15:20:55,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 15:20:55,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 15:20:55,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 15:20:55,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 15:20:55,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 15:20:55,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 15:20:55,550 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 15:20:55,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 15:20:55,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 15:20:55,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 15:20:55,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 15:20:55,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 15:20:55,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 15:20:55,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 15:20:55,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 15:20:55,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 15:20:55,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 15:20:55,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 15:20:55,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 15:20:55,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 15:20:55,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 15:20:55,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 15:20:55,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 15:20:55,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 15:20:55,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 15:20:55,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 15:20:55,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 15:20:55,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 15:20:55,572 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:20:55,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 15:20:55,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 15:20:55,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 15:20:55,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 15:20:55,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 15:20:55,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 15:20:55,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 15:20:55,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 15:20:55,602 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 15:20:55,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 15:20:55,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 15:20:55,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 15:20:55,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 15:20:55,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 15:20:55,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 15:20:55,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 15:20:55,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 15:20:55,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 15:20:55,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 15:20:55,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 15:20:55,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 15:20:55,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 15:20:55,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 15:20:55,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 15:20:55,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 15:20:55,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 15:20:55,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 15:20:55,607 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 15:20:55,607 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 15:20:55,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 15:20:55,608 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 -> 67e7778ced54570c612880d3f2f5d48e6e2d3dc55afd632628e45d31cdc74c58 [2022-07-12 15:20:55,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 15:20:55,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 15:20:55,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 15:20:55,830 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 15:20:55,830 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 15:20:55,831 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-irda-via-ircc.cil.i [2022-07-12 15:20:55,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a44b20c/e4a43e8cfc32437ab9b08316b47c61b0/FLAGf9f8fef35 [2022-07-12 15:20:56,517 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 15:20:56,518 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-irda-via-ircc.cil.i [2022-07-12 15:20:56,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a44b20c/e4a43e8cfc32437ab9b08316b47c61b0/FLAGf9f8fef35 [2022-07-12 15:20:56,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a44b20c/e4a43e8cfc32437ab9b08316b47c61b0 [2022-07-12 15:20:56,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 15:20:56,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 15:20:56,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 15:20:56,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 15:20:56,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 15:20:56,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f148f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56, skipping insertion in model container [2022-07-12 15:20:56,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 15:20:56,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 15:20:58,802 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-irda-via-ircc.cil.i[329615,329628] [2022-07-12 15:20:58,807 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-irda-via-ircc.cil.i[329784,329797] [2022-07-12 15:20:58,813 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-irda-via-ircc.cil.i[329951,329964] [2022-07-12 15:20:58,818 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-irda-via-ircc.cil.i[330119,330132] [2022-07-12 15:20:58,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 15:20:58,871 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 15:20:59,176 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-irda-via-ircc.cil.i[329615,329628] [2022-07-12 15:20:59,176 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-irda-via-ircc.cil.i[329784,329797] [2022-07-12 15:20:59,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[329951,329964] [2022-07-12 15:20:59,178 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-irda-via-ircc.cil.i[330119,330132] [2022-07-12 15:20:59,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 15:20:59,309 INFO L208 MainTranslator]: Completed translation [2022-07-12 15:20:59,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59 WrapperNode [2022-07-12 15:20:59,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 15:20:59,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 15:20:59,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 15:20:59,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 15:20:59,317 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:20:59" (1/1) ... [2022-07-12 15:20:59,407 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:20:59" (1/1) ... [2022-07-12 15:20:59,560 INFO L137 Inliner]: procedures = 395, calls = 2038, calls flagged for inlining = 159, calls inlined = 138, statements flattened = 4403 [2022-07-12 15:20:59,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 15:20:59,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 15:20:59,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 15:20:59,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 15:20:59,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (1/1) ... [2022-07-12 15:20:59,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (1/1) ... [2022-07-12 15:20:59,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (1/1) ... [2022-07-12 15:20:59,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (1/1) ... [2022-07-12 15:20:59,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (1/1) ... [2022-07-12 15:20:59,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (1/1) ... [2022-07-12 15:20:59,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (1/1) ... [2022-07-12 15:20:59,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 15:20:59,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 15:20:59,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 15:20:59,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 15:20:59,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (1/1) ... [2022-07-12 15:20:59,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 15:20:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 15:20:59,824 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:20:59,843 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:20:59,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 15:20:59,866 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 15:20:59,866 INFO L130 BoogieDeclarations]: Found specification of procedure RxCurCount [2022-07-12 15:20:59,866 INFO L138 BoogieDeclarations]: Found implementation of procedure RxCurCount [2022-07-12 15:20:59,866 INFO L130 BoogieDeclarations]: Found specification of procedure irda_setup_dma [2022-07-12 15:20:59,867 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_setup_dma [2022-07-12 15:20:59,867 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-12 15:20:59,867 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-12 15:20:59,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 15:20:59,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 15:20:59,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_73 [2022-07-12 15:20:59,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_73 [2022-07-12 15:20:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-12 15:20:59,906 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-12 15:20:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure CheckRegBit [2022-07-12 15:20:59,906 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckRegBit [2022-07-12 15:20:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 15:20:59,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 15:20:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure via_remove_one [2022-07-12 15:20:59,906 INFO L138 BoogieDeclarations]: Found implementation of procedure via_remove_one [2022-07-12 15:20:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_change_speed [2022-07-12 15:20:59,906 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_change_speed [2022-07-12 15:20:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure dma_zalloc_coherent [2022-07-12 15:20:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_zalloc_coherent [2022-07-12 15:20:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 15:20:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 15:20:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure SetPulseWidth [2022-07-12 15:20:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure SetPulseWidth [2022-07-12 15:20:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure Tdelay [2022-07-12 15:20:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure Tdelay [2022-07-12 15:20:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-12 15:20:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-12 15:20:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 15:20:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 15:20:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 15:20:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure ClkTx [2022-07-12 15:20:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ClkTx [2022-07-12 15:20:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure WriteLPCReg [2022-07-12 15:20:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteLPCReg [2022-07-12 15:20:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-12 15:20:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-12 15:20:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure CommonInit [2022-07-12 15:20:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure CommonInit [2022-07-12 15:20:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 15:20:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 15:20:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_change_dongle_speed [2022-07-12 15:20:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_change_dongle_speed [2022-07-12 15:20:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure ReadLPCReg [2022-07-12 15:20:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadLPCReg [2022-07-12 15:20:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 15:20:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure free_dma [2022-07-12 15:20:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure free_dma [2022-07-12 15:20:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_via_ircc_cb [2022-07-12 15:20:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_via_ircc_cb [2022-07-12 15:20:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_dma_receive [2022-07-12 15:20:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_dma_receive [2022-07-12 15:20:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 15:20:59,910 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 15:20:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 15:20:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 15:20:59,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 15:20:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_net_close [2022-07-12 15:20:59,910 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_net_close [2022-07-12 15:20:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 15:20:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 15:20:59,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 15:20:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure CkRxRecv [2022-07-12 15:20:59,910 INFO L138 BoogieDeclarations]: Found implementation of procedure CkRxRecv [2022-07-12 15:20:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-12 15:20:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-12 15:20:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 15:20:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 15:20:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure irda_get_next_speed [2022-07-12 15:20:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_get_next_speed [2022-07-12 15:20:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure ReadReg [2022-07-12 15:20:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadReg [2022-07-12 15:20:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_open [2022-07-12 15:20:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_open [2022-07-12 15:20:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-12 15:20:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-12 15:20:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure WriteRegBit [2022-07-12 15:20:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteRegBit [2022-07-12 15:20:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 15:20:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2022-07-12 15:20:59,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2022-07-12 15:20:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure Wr_Indx [2022-07-12 15:20:59,912 INFO L138 BoogieDeclarations]: Found implementation of procedure Wr_Indx [2022-07-12 15:20:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 15:20:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 15:20:59,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 15:20:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-12 15:20:59,912 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-12 15:20:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 15:20:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 15:20:59,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 15:20:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 15:20:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 15:20:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure WriteReg [2022-07-12 15:20:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteReg [2022-07-12 15:20:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-12 15:20:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-12 15:20:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 15:20:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 15:20:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure SetBaudRate [2022-07-12 15:20:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure SetBaudRate [2022-07-12 15:20:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure Wr_Byte [2022-07-12 15:20:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure Wr_Byte [2022-07-12 15:20:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 15:20:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 15:20:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-12 15:20:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-12 15:20:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_net_open [2022-07-12 15:20:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_net_open [2022-07-12 15:20:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 15:20:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 15:20:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure ResetChip [2022-07-12 15:20:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ResetChip [2022-07-12 15:20:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 15:20:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 15:20:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 15:20:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 15:20:59,915 INFO L130 BoogieDeclarations]: Found specification of procedure irda_device_txqueue_empty [2022-07-12 15:20:59,915 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_device_txqueue_empty [2022-07-12 15:20:59,915 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 15:20:59,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 15:20:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure pci_read_config_byte [2022-07-12 15:20:59,919 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_read_config_byte [2022-07-12 15:20:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure Sdelay [2022-07-12 15:20:59,919 INFO L138 BoogieDeclarations]: Found implementation of procedure Sdelay [2022-07-12 15:20:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure SetSIR [2022-07-12 15:20:59,919 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSIR [2022-07-12 15:20:59,919 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 15:20:59,919 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 15:20:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure SetMaxRxPacketSize [2022-07-12 15:20:59,920 INFO L138 BoogieDeclarations]: Found implementation of procedure SetMaxRxPacketSize [2022-07-12 15:20:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure GetRecvByte [2022-07-12 15:20:59,920 INFO L138 BoogieDeclarations]: Found implementation of procedure GetRecvByte [2022-07-12 15:20:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 15:20:59,920 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 15:20:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 15:20:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 15:20:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure hwreset [2022-07-12 15:20:59,921 INFO L138 BoogieDeclarations]: Found implementation of procedure hwreset [2022-07-12 15:20:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 15:20:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 15:20:59,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 15:20:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2022-07-12 15:20:59,922 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2022-07-12 15:20:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 15:20:59,923 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 15:20:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-12 15:20:59,923 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-12 15:20:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 15:20:59,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 15:20:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-12 15:20:59,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-12 15:20:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_dma_xmit [2022-07-12 15:20:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_dma_xmit [2022-07-12 15:20:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-12 15:20:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-12 15:20:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2022-07-12 15:20:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2022-07-12 15:20:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 15:20:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 15:20:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 15:20:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 15:20:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-12 15:20:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-12 15:20:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 15:20:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure net_ratelimit [2022-07-12 15:20:59,926 INFO L138 BoogieDeclarations]: Found implementation of procedure net_ratelimit [2022-07-12 15:20:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure SetSendByte [2022-07-12 15:20:59,926 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSendByte [2022-07-12 15:20:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-12 15:20:59,926 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-12 15:20:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 15:20:59,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 15:20:59,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_via_ircc_cb [2022-07-12 15:20:59,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_via_ircc_cb [2022-07-12 15:20:59,927 INFO L130 BoogieDeclarations]: Found specification of procedure SetSendPreambleCount [2022-07-12 15:20:59,928 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSendPreambleCount [2022-07-12 15:20:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure InitCard [2022-07-12 15:20:59,928 INFO L138 BoogieDeclarations]: Found implementation of procedure InitCard [2022-07-12 15:20:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 15:20:59,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 15:20:59,929 INFO L130 BoogieDeclarations]: Found specification of procedure SetTimer [2022-07-12 15:20:59,929 INFO L138 BoogieDeclarations]: Found implementation of procedure SetTimer [2022-07-12 15:20:59,929 INFO L130 BoogieDeclarations]: Found specification of procedure ActClk [2022-07-12 15:20:59,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ActClk [2022-07-12 15:20:59,929 INFO L130 BoogieDeclarations]: Found specification of procedure request_dma [2022-07-12 15:20:59,929 INFO L138 BoogieDeclarations]: Found implementation of procedure request_dma [2022-07-12 15:20:59,929 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-12 15:20:59,930 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-12 15:20:59,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 15:20:59,930 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-12 15:20:59,930 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-12 15:20:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-12 15:20:59,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-12 15:20:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_to_linear_data [2022-07-12 15:20:59,931 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_to_linear_data [2022-07-12 15:21:00,509 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 15:21:00,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 15:21:00,708 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 15:21:03,528 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-12 15:21:04,171 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 15:21:04,193 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 15:21:04,193 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 15:21:04,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:21:04 BoogieIcfgContainer [2022-07-12 15:21:04,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 15:21:04,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 15:21:04,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 15:21:04,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 15:21:04,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:56" (1/3) ... [2022-07-12 15:21:04,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3a5ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:21:04, skipping insertion in model container [2022-07-12 15:21:04,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:59" (2/3) ... [2022-07-12 15:21:04,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3a5ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:21:04, skipping insertion in model container [2022-07-12 15:21:04,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:21:04" (3/3) ... [2022-07-12 15:21:04,205 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i [2022-07-12 15:21:04,229 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 15:21:04,229 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 15:21:04,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 15:21:04,335 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@60a37907, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@234c8855 [2022-07-12 15:21:04,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 15:21:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 1999 states, 1251 states have (on average 1.3069544364508394) internal successors, (1635), 1277 states have internal predecessors, (1635), 654 states have call successors, (654), 92 states have call predecessors, (654), 91 states have return successors, (650), 638 states have call predecessors, (650), 650 states have call successors, (650) [2022-07-12 15:21:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-12 15:21:04,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:04,359 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] [2022-07-12 15:21:04,359 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:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1658643117, now seen corresponding path program 1 times [2022-07-12 15:21:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:04,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441946781] [2022-07-12 15:21:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:05,016 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:05,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:05,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441946781] [2022-07-12 15:21:05,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441946781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:05,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:05,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193644711] [2022-07-12 15:21:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:05,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:05,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:05,059 INFO L87 Difference]: Start difference. First operand has 1999 states, 1251 states have (on average 1.3069544364508394) internal successors, (1635), 1277 states have internal predecessors, (1635), 654 states have call successors, (654), 92 states have call predecessors, (654), 91 states have return successors, (650), 638 states have call predecessors, (650), 650 states have call successors, (650) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:11,421 INFO L93 Difference]: Finished difference Result 5917 states and 8905 transitions. [2022-07-12 15:21:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 79 [2022-07-12 15:21:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:11,488 INFO L225 Difference]: With dead ends: 5917 [2022-07-12 15:21:11,488 INFO L226 Difference]: Without dead ends: 3924 [2022-07-12 15:21:11,512 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:11,515 INFO L413 NwaCegarLoop]: 2797 mSDtfsCounter, 3435 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 2339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4055 SdHoareTripleChecker+Valid, 4650 SdHoareTripleChecker+Invalid, 5420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2339 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:11,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4055 Valid, 4650 Invalid, 5420 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2339 Valid, 3081 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-12 15:21:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2022-07-12 15:21:11,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3892. [2022-07-12 15:21:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 2442 states have (on average 1.2665847665847665) internal successors, (3093), 2492 states have internal predecessors, (3093), 1268 states have call successors, (1268), 180 states have call predecessors, (1268), 179 states have return successors, (1265), 1241 states have call predecessors, (1265), 1265 states have call successors, (1265) [2022-07-12 15:21:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5626 transitions. [2022-07-12 15:21:11,900 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5626 transitions. Word has length 79 [2022-07-12 15:21:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:11,902 INFO L495 AbstractCegarLoop]: Abstraction has 3892 states and 5626 transitions. [2022-07-12 15:21:11,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5626 transitions. [2022-07-12 15:21:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 15:21:11,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:11,912 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:11,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 15:21:11,913 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:11,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2063132158, now seen corresponding path program 1 times [2022-07-12 15:21:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:11,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117091943] [2022-07-12 15:21:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 15:21:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,157 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:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:12,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117091943] [2022-07-12 15:21:12,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117091943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:12,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:12,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188065673] [2022-07-12 15:21:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:12,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:12,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:12,160 INFO L87 Difference]: Start difference. First operand 3892 states and 5626 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (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:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:18,037 INFO L93 Difference]: Finished difference Result 10862 states and 15735 transitions. [2022-07-12 15:21:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:18,037 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:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:18,091 INFO L225 Difference]: With dead ends: 10862 [2022-07-12 15:21:18,091 INFO L226 Difference]: Without dead ends: 6985 [2022-07-12 15:21:18,118 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:18,120 INFO L413 NwaCegarLoop]: 2782 mSDtfsCounter, 2896 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 2962 mSolverCounterSat, 2130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3440 SdHoareTripleChecker+Valid, 4665 SdHoareTripleChecker+Invalid, 5092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2130 IncrementalHoareTripleChecker+Valid, 2962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:18,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3440 Valid, 4665 Invalid, 5092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2130 Valid, 2962 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 15:21:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6985 states. [2022-07-12 15:21:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6985 to 6916. [2022-07-12 15:21:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6916 states, 4317 states have (on average 1.2596710678712069) internal successors, (5438), 4417 states have internal predecessors, (5438), 2267 states have call successors, (2267), 330 states have call predecessors, (2267), 329 states have return successors, (2302), 2208 states have call predecessors, (2302), 2264 states have call successors, (2302) [2022-07-12 15:21:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 10007 transitions. [2022-07-12 15:21:18,498 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 10007 transitions. Word has length 83 [2022-07-12 15:21:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:18,500 INFO L495 AbstractCegarLoop]: Abstraction has 6916 states and 10007 transitions. [2022-07-12 15:21:18,501 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:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 10007 transitions. [2022-07-12 15:21:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 15:21:18,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:18,503 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] [2022-07-12 15:21:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 15:21:18,503 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:21:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash -687884744, now seen corresponding path program 1 times [2022-07-12 15:21:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:18,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187863384] [2022-07-12 15:21:18,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 15:21:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,800 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:18,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:18,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187863384] [2022-07-12 15:21:18,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187863384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:18,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:18,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374718796] [2022-07-12 15:21:18,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:18,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:18,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:18,802 INFO L87 Difference]: Start difference. First operand 6916 states and 10007 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (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:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:24,832 INFO L93 Difference]: Finished difference Result 19838 states and 28768 transitions. [2022-07-12 15:21:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (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 87 [2022-07-12 15:21:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:24,956 INFO L225 Difference]: With dead ends: 19838 [2022-07-12 15:21:24,956 INFO L226 Difference]: Without dead ends: 12937 [2022-07-12 15:21:24,999 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:25,002 INFO L413 NwaCegarLoop]: 2763 mSDtfsCounter, 3269 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 2339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3843 SdHoareTripleChecker+Valid, 4622 SdHoareTripleChecker+Invalid, 5379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2339 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:25,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3843 Valid, 4622 Invalid, 5379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2339 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 15:21:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12937 states. [2022-07-12 15:21:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12937 to 12832. [2022-07-12 15:21:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12832 states, 8011 states have (on average 1.258519535638497) internal successors, (10082), 8213 states have internal predecessors, (10082), 4205 states have call successors, (4205), 622 states have call predecessors, (4205), 613 states have return successors, (4294), 4068 states have call predecessors, (4294), 4202 states have call successors, (4294) [2022-07-12 15:21:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12832 states to 12832 states and 18581 transitions. [2022-07-12 15:21:25,809 INFO L78 Accepts]: Start accepts. Automaton has 12832 states and 18581 transitions. Word has length 87 [2022-07-12 15:21:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:25,809 INFO L495 AbstractCegarLoop]: Abstraction has 12832 states and 18581 transitions. [2022-07-12 15:21:25,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (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:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12832 states and 18581 transitions. [2022-07-12 15:21:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 15:21:25,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:25,819 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:21:25,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 15:21:25,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash 435513709, now seen corresponding path program 1 times [2022-07-12 15:21:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:25,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350181730] [2022-07-12 15:21:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:25,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:25,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:21:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:21:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:21:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:21:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:21:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:21:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-12 15:21:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:26,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350181730] [2022-07-12 15:21:26,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350181730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:26,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:26,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151779752] [2022-07-12 15:21:26,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:26,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:26,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:26,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:26,087 INFO L87 Difference]: Start difference. First operand 12832 states and 18581 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 15:21:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:31,202 INFO L93 Difference]: Finished difference Result 25813 states and 37407 transitions. [2022-07-12 15:21:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:31,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2022-07-12 15:21:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:31,316 INFO L225 Difference]: With dead ends: 25813 [2022-07-12 15:21:31,316 INFO L226 Difference]: Without dead ends: 19268 [2022-07-12 15:21:31,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:31,353 INFO L413 NwaCegarLoop]: 4917 mSDtfsCounter, 2630 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 3114 mSolverCounterSat, 1755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3244 SdHoareTripleChecker+Valid, 7484 SdHoareTripleChecker+Invalid, 4869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1755 IncrementalHoareTripleChecker+Valid, 3114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:31,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3244 Valid, 7484 Invalid, 4869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1755 Valid, 3114 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 15:21:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2022-07-12 15:21:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19148. [2022-07-12 15:21:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19148 states, 11951 states have (on average 1.2585557693916827) internal successors, (15041), 12249 states have internal predecessors, (15041), 6275 states have call successors, (6275), 932 states have call predecessors, (6275), 919 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-12 15:21:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19148 states to 19148 states and 27726 transitions. [2022-07-12 15:21:32,321 INFO L78 Accepts]: Start accepts. Automaton has 19148 states and 27726 transitions. Word has length 134 [2022-07-12 15:21:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:32,322 INFO L495 AbstractCegarLoop]: Abstraction has 19148 states and 27726 transitions. [2022-07-12 15:21:32,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 15:21:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 19148 states and 27726 transitions. [2022-07-12 15:21:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 15:21:32,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:32,326 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:21:32,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 15:21:32,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 15:21:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:32,327 INFO L85 PathProgramCache]: Analyzing trace with hash 858215535, now seen corresponding path program 1 times [2022-07-12 15:21:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:32,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707655908] [2022-07-12 15:21:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:21:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:21:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:21:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:21:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:21:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:21:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-12 15:21:32,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:32,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707655908] [2022-07-12 15:21:32,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707655908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:32,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:32,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663185940] [2022-07-12 15:21:32,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:32,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:32,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:32,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:32,709 INFO L87 Difference]: Start difference. First operand 19148 states and 27726 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 15:21:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:38,161 INFO L93 Difference]: Finished difference Result 19250 states and 27922 transitions. [2022-07-12 15:21:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:21:38,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2022-07-12 15:21:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:38,290 INFO L225 Difference]: With dead ends: 19250 [2022-07-12 15:21:38,290 INFO L226 Difference]: Without dead ends: 19248 [2022-07-12 15:21:38,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 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:21:38,311 INFO L413 NwaCegarLoop]: 2498 mSDtfsCounter, 2664 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2918 SdHoareTripleChecker+Valid, 5473 SdHoareTripleChecker+Invalid, 5976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1753 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:38,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2918 Valid, 5473 Invalid, 5976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1753 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-12 15:21:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19248 states. [2022-07-12 15:21:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19248 to 19152. [2022-07-12 15:21:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19152 states, 11954 states have (on average 1.258490881713234) internal successors, (15044), 12252 states have internal predecessors, (15044), 6275 states have call successors, (6275), 933 states have call predecessors, (6275), 920 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-12 15:21:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19152 states to 19152 states and 27729 transitions. [2022-07-12 15:21:39,322 INFO L78 Accepts]: Start accepts. Automaton has 19152 states and 27729 transitions. Word has length 134 [2022-07-12 15:21:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:39,322 INFO L495 AbstractCegarLoop]: Abstraction has 19152 states and 27729 transitions. [2022-07-12 15:21:39,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 15:21:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19152 states and 27729 transitions. [2022-07-12 15:21:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 15:21:39,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:39,326 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:21:39,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 15:21:39,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 15:21:39,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1459207571, now seen corresponding path program 1 times [2022-07-12 15:21:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:39,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254901930] [2022-07-12 15:21:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:21:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:21:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:21:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:21:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:21:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:21:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:21:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-12 15:21:39,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:39,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254901930] [2022-07-12 15:21:39,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254901930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:39,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:39,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:39,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105691357] [2022-07-12 15:21:39,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:39,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:39,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:39,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:39,570 INFO L87 Difference]: Start difference. First operand 19152 states and 27729 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 15:21:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:44,537 INFO L93 Difference]: Finished difference Result 19254 states and 27925 transitions. [2022-07-12 15:21:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:21:44,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2022-07-12 15:21:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:44,657 INFO L225 Difference]: With dead ends: 19254 [2022-07-12 15:21:44,657 INFO L226 Difference]: Without dead ends: 19252 [2022-07-12 15:21:44,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:21:44,681 INFO L413 NwaCegarLoop]: 2502 mSDtfsCounter, 2656 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 5975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1752 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:44,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 5480 Invalid, 5975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1752 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-12 15:21:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19252 states. [2022-07-12 15:21:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19252 to 19156. [2022-07-12 15:21:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19156 states, 11957 states have (on average 1.2584260265952998) internal successors, (15047), 12255 states have internal predecessors, (15047), 6275 states have call successors, (6275), 934 states have call predecessors, (6275), 921 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-12 15:21:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19156 states to 19156 states and 27732 transitions. [2022-07-12 15:21:45,618 INFO L78 Accepts]: Start accepts. Automaton has 19156 states and 27732 transitions. Word has length 139 [2022-07-12 15:21:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:45,619 INFO L495 AbstractCegarLoop]: Abstraction has 19156 states and 27732 transitions. [2022-07-12 15:21:45,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 15:21:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 19156 states and 27732 transitions. [2022-07-12 15:21:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 15:21:45,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:45,623 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:21:45,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 15:21:45,624 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:21:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1275034351, now seen corresponding path program 1 times [2022-07-12 15:21:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257264830] [2022-07-12 15:21:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:21:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:21:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:21:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:21:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:21:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:21:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:21:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:21:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-12 15:21:45,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:45,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257264830] [2022-07-12 15:21:45,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257264830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:45,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:45,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340702613] [2022-07-12 15:21:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:45,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:45,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:45,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:45,877 INFO L87 Difference]: Start difference. First operand 19156 states and 27732 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:21:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:51,860 INFO L93 Difference]: Finished difference Result 19258 states and 27928 transitions. [2022-07-12 15:21:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:21:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 144 [2022-07-12 15:21:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:51,980 INFO L225 Difference]: With dead ends: 19258 [2022-07-12 15:21:51,980 INFO L226 Difference]: Without dead ends: 19256 [2022-07-12 15:21:52,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:21:52,005 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2656 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1751 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1751 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:52,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 5476 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1751 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 15:21:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19256 states. [2022-07-12 15:21:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19256 to 19160. [2022-07-12 15:21:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19160 states, 11960 states have (on average 1.258361204013378) internal successors, (15050), 12258 states have internal predecessors, (15050), 6275 states have call successors, (6275), 935 states have call predecessors, (6275), 922 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-12 15:21:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19160 states to 19160 states and 27735 transitions. [2022-07-12 15:21:52,973 INFO L78 Accepts]: Start accepts. Automaton has 19160 states and 27735 transitions. Word has length 144 [2022-07-12 15:21:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:52,973 INFO L495 AbstractCegarLoop]: Abstraction has 19160 states and 27735 transitions. [2022-07-12 15:21:52,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:21:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 19160 states and 27735 transitions. [2022-07-12 15:21:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 15:21:52,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:52,979 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:21:52,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 15:21:52,979 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:21:52,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash 167533421, now seen corresponding path program 1 times [2022-07-12 15:21:52,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:52,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687484994] [2022-07-12 15:21:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:21:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:21:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:21:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:21:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:21:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:21:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:21:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:21:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:21:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-12 15:21:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687484994] [2022-07-12 15:21:53,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687484994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:53,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:53,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319805014] [2022-07-12 15:21:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:53,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:53,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:53,242 INFO L87 Difference]: Start difference. First operand 19160 states and 27735 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:21:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:58,137 INFO L93 Difference]: Finished difference Result 19262 states and 27931 transitions. [2022-07-12 15:21:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:21:58,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 149 [2022-07-12 15:21:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:58,233 INFO L225 Difference]: With dead ends: 19262 [2022-07-12 15:21:58,233 INFO L226 Difference]: Without dead ends: 19260 [2022-07-12 15:21:58,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:21:58,256 INFO L413 NwaCegarLoop]: 2502 mSDtfsCounter, 2656 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 5973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1750 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:58,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 5480 Invalid, 5973 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1750 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 15:21:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19260 states. [2022-07-12 15:21:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19260 to 19164. [2022-07-12 15:21:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19164 states, 11963 states have (on average 1.2582964139429909) internal successors, (15053), 12261 states have internal predecessors, (15053), 6275 states have call successors, (6275), 936 states have call predecessors, (6275), 923 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-12 15:21:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19164 states to 19164 states and 27738 transitions. [2022-07-12 15:21:59,101 INFO L78 Accepts]: Start accepts. Automaton has 19164 states and 27738 transitions. Word has length 149 [2022-07-12 15:21:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:59,101 INFO L495 AbstractCegarLoop]: Abstraction has 19164 states and 27738 transitions. [2022-07-12 15:21:59,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:21:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 19164 states and 27738 transitions. [2022-07-12 15:21:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-12 15:21:59,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:59,106 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:21:59,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 15:21:59,107 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:21:59,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1104465553, now seen corresponding path program 1 times [2022-07-12 15:21:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:59,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174820826] [2022-07-12 15:21:59,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:21:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:21:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:21:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:21:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:21:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:21:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:21:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:21:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:21:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:21:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 15:21:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-12 15:21:59,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:59,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174820826] [2022-07-12 15:21:59,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174820826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:59,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:59,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005699171] [2022-07-12 15:21:59,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:59,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:59,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:59,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:59,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:59,334 INFO L87 Difference]: Start difference. First operand 19164 states and 27738 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:22:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:04,518 INFO L93 Difference]: Finished difference Result 19266 states and 27934 transitions. [2022-07-12 15:22:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:04,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 154 [2022-07-12 15:22:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:04,620 INFO L225 Difference]: With dead ends: 19266 [2022-07-12 15:22:04,621 INFO L226 Difference]: Without dead ends: 19264 [2022-07-12 15:22:04,643 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:22:04,644 INFO L413 NwaCegarLoop]: 2502 mSDtfsCounter, 2656 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 5972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:04,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 5480 Invalid, 5972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 15:22:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19264 states. [2022-07-12 15:22:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19264 to 19168. [2022-07-12 15:22:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19168 states, 11966 states have (on average 1.2582316563596858) internal successors, (15056), 12264 states have internal predecessors, (15056), 6275 states have call successors, (6275), 937 states have call predecessors, (6275), 924 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-12 15:22:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19168 states to 19168 states and 27741 transitions. [2022-07-12 15:22:05,598 INFO L78 Accepts]: Start accepts. Automaton has 19168 states and 27741 transitions. Word has length 154 [2022-07-12 15:22:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:05,599 INFO L495 AbstractCegarLoop]: Abstraction has 19168 states and 27741 transitions. [2022-07-12 15:22:05,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:22:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 19168 states and 27741 transitions. [2022-07-12 15:22:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 15:22:05,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:05,604 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:22:05,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 15:22:05,605 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:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1487346579, now seen corresponding path program 1 times [2022-07-12 15:22:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:05,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593475633] [2022-07-12 15:22:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:05,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:22:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:22:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:22:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:22:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:22:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:22:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:22:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:22:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:22:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:22:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 15:22:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:22:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-07-12 15:22:05,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:05,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593475633] [2022-07-12 15:22:05,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593475633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:05,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988751775] [2022-07-12 15:22:05,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:05,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:05,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:05,846 INFO L87 Difference]: Start difference. First operand 19168 states and 27741 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:22:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:12,041 INFO L93 Difference]: Finished difference Result 19270 states and 27937 transitions. [2022-07-12 15:22:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:12,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 159 [2022-07-12 15:22:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:12,142 INFO L225 Difference]: With dead ends: 19270 [2022-07-12 15:22:12,142 INFO L226 Difference]: Without dead ends: 19268 [2022-07-12 15:22:12,158 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:22:12,159 INFO L413 NwaCegarLoop]: 2502 mSDtfsCounter, 2656 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 5971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1748 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:12,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 5480 Invalid, 5971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1748 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 15:22:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2022-07-12 15:22:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19172. [2022-07-12 15:22:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19172 states, 11969 states have (on average 1.2581669312390342) internal successors, (15059), 12267 states have internal predecessors, (15059), 6275 states have call successors, (6275), 938 states have call predecessors, (6275), 925 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-12 15:22:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19172 states to 19172 states and 27744 transitions. [2022-07-12 15:22:12,954 INFO L78 Accepts]: Start accepts. Automaton has 19172 states and 27744 transitions. Word has length 159 [2022-07-12 15:22:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:12,955 INFO L495 AbstractCegarLoop]: Abstraction has 19172 states and 27744 transitions. [2022-07-12 15:22:12,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:22:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 19172 states and 27744 transitions. [2022-07-12 15:22:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 15:22:12,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:12,962 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:22:12,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 15:22:12,962 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 15:22:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1153065481, now seen corresponding path program 1 times [2022-07-12 15:22:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:12,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139854227] [2022-07-12 15:22:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 15:22:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 15:22:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 15:22:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 15:22:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 15:22:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 15:22:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 15:22:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 15:22:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-12 15:22:13,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:13,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139854227] [2022-07-12 15:22:13,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139854227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:13,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:13,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:22:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462992951] [2022-07-12 15:22:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:13,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:22:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:22:13,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:22:13,189 INFO L87 Difference]: Start difference. First operand 19172 states and 27744 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 15:22:17,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 15:22:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:25,738 INFO L93 Difference]: Finished difference Result 39320 states and 57027 transitions. [2022-07-12 15:22:25,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:25,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 156 [2022-07-12 15:22:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:25,821 INFO L225 Difference]: With dead ends: 39320 [2022-07-12 15:22:25,822 INFO L226 Difference]: Without dead ends: 20163 [2022-07-12 15:22:25,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 15:22:25,895 INFO L413 NwaCegarLoop]: 3044 mSDtfsCounter, 3385 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 3505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3884 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 6951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3505 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:25,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3884 Valid, 4929 Invalid, 6951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3505 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2022-07-12 15:22:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20163 states. [2022-07-12 15:22:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20163 to 19855. [2022-07-12 15:22:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19855 states, 12321 states have (on average 1.256797337878419) internal successors, (15485), 12601 states have internal predecessors, (15485), 6544 states have call successors, (6544), 988 states have call predecessors, (6544), 987 states have return successors, (6649), 6373 states have call predecessors, (6649), 6541 states have call successors, (6649) [2022-07-12 15:22:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19855 states to 19855 states and 28678 transitions. [2022-07-12 15:22:26,920 INFO L78 Accepts]: Start accepts. Automaton has 19855 states and 28678 transitions. Word has length 156 [2022-07-12 15:22:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:26,921 INFO L495 AbstractCegarLoop]: Abstraction has 19855 states and 28678 transitions. [2022-07-12 15:22:26,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 15:22:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 19855 states and 28678 transitions. [2022-07-12 15:22:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 15:22:26,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:26,924 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:22:26,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 15:22:26,924 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:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:26,925 INFO L85 PathProgramCache]: Analyzing trace with hash -495552529, now seen corresponding path program 1 times [2022-07-12 15:22:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:26,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180164167] [2022-07-12 15:22:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:22:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:22:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:22:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:22:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:22:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:22:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:22:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:22:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:22:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:22:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 15:22:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:22:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 15:22:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-12 15:22:27,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:27,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180164167] [2022-07-12 15:22:27,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180164167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:27,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:27,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:27,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661470473] [2022-07-12 15:22:27,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:27,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:27,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:27,174 INFO L87 Difference]: Start difference. First operand 19855 states and 28678 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:22:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:32,764 INFO L93 Difference]: Finished difference Result 19969 states and 28884 transitions. [2022-07-12 15:22:32,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 164 [2022-07-12 15:22:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:32,859 INFO L225 Difference]: With dead ends: 19969 [2022-07-12 15:22:32,859 INFO L226 Difference]: Without dead ends: 19967 [2022-07-12 15:22:32,879 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:22:32,880 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2656 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1747 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:32,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 5476 Invalid, 5970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1747 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 15:22:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19967 states. [2022-07-12 15:22:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19967 to 19859. [2022-07-12 15:22:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19859 states, 12324 states have (on average 1.2567348263550795) internal successors, (15488), 12604 states have internal predecessors, (15488), 6544 states have call successors, (6544), 989 states have call predecessors, (6544), 988 states have return successors, (6649), 6373 states have call predecessors, (6649), 6541 states have call successors, (6649) [2022-07-12 15:22:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19859 states to 19859 states and 28681 transitions. [2022-07-12 15:22:34,033 INFO L78 Accepts]: Start accepts. Automaton has 19859 states and 28681 transitions. Word has length 164 [2022-07-12 15:22:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:34,033 INFO L495 AbstractCegarLoop]: Abstraction has 19859 states and 28681 transitions. [2022-07-12 15:22:34,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:22:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 19859 states and 28681 transitions. [2022-07-12 15:22:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 15:22:34,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:34,036 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:22:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 15:22:34,037 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:22:34,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash -942678675, now seen corresponding path program 1 times [2022-07-12 15:22:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:34,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452576980] [2022-07-12 15:22:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:22:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:22:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:22:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:22:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:22:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:22:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:22:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:22:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:22:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:22:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 15:22:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:22:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 15:22:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 15:22:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-07-12 15:22:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452576980] [2022-07-12 15:22:34,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452576980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:34,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:34,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:34,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861650611] [2022-07-12 15:22:34,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:34,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:34,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:34,287 INFO L87 Difference]: Start difference. First operand 19859 states and 28681 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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) [2022-07-12 15:22:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:40,610 INFO L93 Difference]: Finished difference Result 19973 states and 28887 transitions. [2022-07-12 15:22:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:40,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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) Word has length 169 [2022-07-12 15:22:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:40,718 INFO L225 Difference]: With dead ends: 19973 [2022-07-12 15:22:40,718 INFO L226 Difference]: Without dead ends: 19971 [2022-07-12 15:22:40,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:22:40,740 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2656 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1746 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:40,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 5476 Invalid, 5969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1746 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 15:22:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19971 states. [2022-07-12 15:22:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19971 to 19863. [2022-07-12 15:22:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19863 states, 12327 states have (on average 1.256672345258376) internal successors, (15491), 12607 states have internal predecessors, (15491), 6544 states have call successors, (6544), 990 states have call predecessors, (6544), 989 states have return successors, (6649), 6373 states have call predecessors, (6649), 6541 states have call successors, (6649) [2022-07-12 15:22:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19863 states to 19863 states and 28684 transitions. [2022-07-12 15:22:41,863 INFO L78 Accepts]: Start accepts. Automaton has 19863 states and 28684 transitions. Word has length 169 [2022-07-12 15:22:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:41,864 INFO L495 AbstractCegarLoop]: Abstraction has 19863 states and 28684 transitions. [2022-07-12 15:22:41,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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) [2022-07-12 15:22:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19863 states and 28684 transitions. [2022-07-12 15:22:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-12 15:22:41,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:41,868 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 15:22:41,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 15:22:41,868 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:22:41,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1949171756, now seen corresponding path program 1 times [2022-07-12 15:22:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:41,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971879931] [2022-07-12 15:22:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:22:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:22:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:22:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:22:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:22:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:22:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 15:22:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:22:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 15:22:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:22:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 15:22:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 15:22:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 15:22:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 15:22:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 15:22:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 15:22:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 15:22:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-07-12 15:22:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:42,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971879931] [2022-07-12 15:22:42,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971879931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:42,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:42,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555651727] [2022-07-12 15:22:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:42,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:42,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:42,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:42,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:42,253 INFO L87 Difference]: Start difference. First operand 19863 states and 28684 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 15:22:44,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 15:22:45,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 15:22:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:53,430 INFO L93 Difference]: Finished difference Result 25949 states and 37670 transitions. [2022-07-12 15:22:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 15:22:53,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 194 [2022-07-12 15:22:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:53,571 INFO L225 Difference]: With dead ends: 25949 [2022-07-12 15:22:53,571 INFO L226 Difference]: Without dead ends: 25947 [2022-07-12 15:22:53,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:22:53,599 INFO L413 NwaCegarLoop]: 3122 mSDtfsCounter, 2197 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 7493 mSolverCounterSat, 1614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 6503 SdHoareTripleChecker+Invalid, 9107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1614 IncrementalHoareTripleChecker+Valid, 7493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:53,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 6503 Invalid, 9107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1614 Valid, 7493 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-07-12 15:22:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25947 states. [2022-07-12 15:22:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25947 to 25831. [2022-07-12 15:22:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25831 states, 15630 states have (on average 1.2525911708253359) internal successors, (19578), 15964 states have internal predecessors, (19578), 8890 states have call successors, (8890), 1309 states have call predecessors, (8890), 1308 states have return successors, (8995), 8689 states have call predecessors, (8995), 8887 states have call successors, (8995) [2022-07-12 15:22:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25831 states to 25831 states and 37463 transitions. [2022-07-12 15:22:55,144 INFO L78 Accepts]: Start accepts. Automaton has 25831 states and 37463 transitions. Word has length 194 [2022-07-12 15:22:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:55,144 INFO L495 AbstractCegarLoop]: Abstraction has 25831 states and 37463 transitions. [2022-07-12 15:22:55,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 15:22:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 25831 states and 37463 transitions. [2022-07-12 15:22:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-12 15:22:55,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:55,149 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:22:55,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 15:22:55,149 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:22:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -518699411, now seen corresponding path program 1 times [2022-07-12 15:22:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:55,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943754555] [2022-07-12 15:22:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:22:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:22:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:22:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:22:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:22:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:22:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:22:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:22:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:22:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:22:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:22:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 15:22:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:22:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 15:22:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 15:22:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 15:22:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 15:22:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-07-12 15:22:55,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:55,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943754555] [2022-07-12 15:22:55,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943754555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:55,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:55,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:55,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983994628] [2022-07-12 15:22:55,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:55,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:55,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:55,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:55,403 INFO L87 Difference]: Start difference. First operand 25831 states and 37463 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 15:23:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:03,006 INFO L93 Difference]: Finished difference Result 25953 states and 37673 transitions. [2022-07-12 15:23:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:23:03,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2022-07-12 15:23:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:03,144 INFO L225 Difference]: With dead ends: 25953 [2022-07-12 15:23:03,144 INFO L226 Difference]: Without dead ends: 25951 [2022-07-12 15:23:03,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 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,173 INFO L413 NwaCegarLoop]: 2502 mSDtfsCounter, 2656 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 5967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1744 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:03,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 5480 Invalid, 5967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1744 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 15:23:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25951 states. [2022-07-12 15:23:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25951 to 25835. [2022-07-12 15:23:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25835 states, 15633 states have (on average 1.252542698138553) internal successors, (19581), 15967 states have internal predecessors, (19581), 8890 states have call successors, (8890), 1310 states have call predecessors, (8890), 1309 states have return successors, (8995), 8689 states have call predecessors, (8995), 8887 states have call successors, (8995) [2022-07-12 15:23:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 37466 transitions. [2022-07-12 15:23:04,774 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 37466 transitions. Word has length 179 [2022-07-12 15:23:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:04,775 INFO L495 AbstractCegarLoop]: Abstraction has 25835 states and 37466 transitions. [2022-07-12 15:23:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 15:23:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 37466 transitions. [2022-07-12 15:23:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-12 15:23:04,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:04,779 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:23:04,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 15:23:04,779 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:04,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1215619476, now seen corresponding path program 1 times [2022-07-12 15:23:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:04,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557876275] [2022-07-12 15:23:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:23:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:23:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:23:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:23:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:23:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:23:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 15:23:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:23:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 15:23:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:23:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 15:23:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 15:23:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 15:23:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 15:23:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 15:23:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 15:23:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 15:23:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 15:23:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 15:23:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2022-07-12 15:23:05,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:05,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557876275] [2022-07-12 15:23:05,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557876275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:05,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:05,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:23:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343873398] [2022-07-12 15:23:05,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:05,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:23:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:05,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:23:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:23:05,100 INFO L87 Difference]: Start difference. First operand 25835 states and 37466 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 15:23:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:12,639 INFO L93 Difference]: Finished difference Result 25957 states and 37676 transitions. [2022-07-12 15:23:12,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:23:12,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 204 [2022-07-12 15:23:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:12,788 INFO L225 Difference]: With dead ends: 25957 [2022-07-12 15:23:12,789 INFO L226 Difference]: Without dead ends: 25955 [2022-07-12 15:23:12,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 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:12,816 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2645 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1743 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1743 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:12,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 5476 Invalid, 5966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1743 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 15:23:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25955 states. [2022-07-12 15:23:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25955 to 25839. [2022-07-12 15:23:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25839 states, 15636 states have (on average 1.2524942440521873) internal successors, (19584), 15970 states have internal predecessors, (19584), 8890 states have call successors, (8890), 1311 states have call predecessors, (8890), 1310 states have return successors, (8995), 8689 states have call predecessors, (8995), 8887 states have call successors, (8995) [2022-07-12 15:23:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25839 states to 25839 states and 37469 transitions. [2022-07-12 15:23:14,390 INFO L78 Accepts]: Start accepts. Automaton has 25839 states and 37469 transitions. Word has length 204 [2022-07-12 15:23:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:14,391 INFO L495 AbstractCegarLoop]: Abstraction has 25839 states and 37469 transitions. [2022-07-12 15:23:14,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 15:23:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25839 states and 37469 transitions. [2022-07-12 15:23:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-12 15:23:14,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:14,395 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:23:14,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 15:23:14,395 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:14,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash -673374355, now seen corresponding path program 1 times [2022-07-12 15:23:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:14,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378037274] [2022-07-12 15:23:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:23:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:23:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:23:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:23:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:23:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:23:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:23:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:23:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:23:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:23:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 15:23:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:23:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 15:23:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 15:23:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 15:23:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 15:23:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 15:23:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 15:23:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-07-12 15:23:14,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378037274] [2022-07-12 15:23:14,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378037274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:14,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:14,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:23:14,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142268954] [2022-07-12 15:23:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:14,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:23:14,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:14,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:23:14,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:23:14,662 INFO L87 Difference]: Start difference. First operand 25839 states and 37469 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 15:23:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:22,260 INFO L93 Difference]: Finished difference Result 25961 states and 37679 transitions. [2022-07-12 15:23:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:23:22,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2022-07-12 15:23:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:22,418 INFO L225 Difference]: With dead ends: 25961 [2022-07-12 15:23:22,418 INFO L226 Difference]: Without dead ends: 25959 [2022-07-12 15:23:22,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 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:22,450 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2656 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1742 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:22,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 5476 Invalid, 5965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1742 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 15:23:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25959 states. [2022-07-12 15:23:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25959 to 25843. [2022-07-12 15:23:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25843 states, 15639 states have (on average 1.2524458085555343) internal successors, (19587), 15973 states have internal predecessors, (19587), 8890 states have call successors, (8890), 1312 states have call predecessors, (8890), 1311 states have return successors, (8995), 8689 states have call predecessors, (8995), 8887 states have call successors, (8995) [2022-07-12 15:23:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25843 states to 25843 states and 37472 transitions. [2022-07-12 15:23:24,176 INFO L78 Accepts]: Start accepts. Automaton has 25843 states and 37472 transitions. Word has length 189 [2022-07-12 15:23:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:24,177 INFO L495 AbstractCegarLoop]: Abstraction has 25843 states and 37472 transitions. [2022-07-12 15:23:24,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 15:23:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25843 states and 37472 transitions. [2022-07-12 15:23:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 15:23:24,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:24,182 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 9, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:23:24,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 15:23:24,182 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 15:23:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1396251820, now seen corresponding path program 1 times [2022-07-12 15:23:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:24,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043243375] [2022-07-12 15:23:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:23:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:23:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:23:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:23:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:23:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:23:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 15:23:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 15:23:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 15:23:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:23:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 15:23:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 15:23:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 15:23:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 15:23:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 15:23:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 15:23:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 15:23:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 15:23:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 15:23:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 15:23:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 15:23:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2022-07-12 15:23:24,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:24,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043243375] [2022-07-12 15:23:24,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043243375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:24,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:24,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:23:24,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143055506] [2022-07-12 15:23:24,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:24,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:23:24,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:24,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:23:24,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:23:24,448 INFO L87 Difference]: Start difference. First operand 25843 states and 37472 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 15:23:26,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 15:23:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:31,991 INFO L93 Difference]: Finished difference Result 25965 states and 37682 transitions. [2022-07-12 15:23:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:23:31,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 214 [2022-07-12 15:23:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:32,132 INFO L225 Difference]: With dead ends: 25965 [2022-07-12 15:23:32,132 INFO L226 Difference]: Without dead ends: 25961 [2022-07-12 15:23:32,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 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:32,160 INFO L413 NwaCegarLoop]: 2500 mSDtfsCounter, 2645 mSDsluCounter, 2972 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2898 SdHoareTripleChecker+Valid, 5472 SdHoareTripleChecker+Invalid, 5964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1741 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:32,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2898 Valid, 5472 Invalid, 5964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1741 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 15:23:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2022-07-12 15:23:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 25845. [2022-07-12 15:23:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25845 states, 15641 states have (on average 1.2523495940157279) internal successors, (19588), 15974 states have internal predecessors, (19588), 8890 states have call successors, (8890), 1313 states have call predecessors, (8890), 1311 states have return successors, (8995), 8689 states have call predecessors, (8995), 8887 states have call successors, (8995) [2022-07-12 15:23:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25845 states to 25845 states and 37473 transitions. [2022-07-12 15:23:33,814 INFO L78 Accepts]: Start accepts. Automaton has 25845 states and 37473 transitions. Word has length 214 [2022-07-12 15:23:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:33,814 INFO L495 AbstractCegarLoop]: Abstraction has 25845 states and 37473 transitions. [2022-07-12 15:23:33,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 15:23:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 25845 states and 37473 transitions. [2022-07-12 15:23:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-12 15:23:33,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:33,819 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:23:33,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 15:23:33,820 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 15:23:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1071343725, now seen corresponding path program 1 times [2022-07-12 15:23:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:33,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301698588] [2022-07-12 15:23:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:23:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:23:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:23:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:23:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 15:23:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:23:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 15:23:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 15:23:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 15:23:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 15:23:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 15:23:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:23:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 15:23:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 15:23:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 15:23:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 15:23:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 15:23:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 15:23:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 15:23:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 15:23:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2022-07-12 15:23:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:34,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301698588] [2022-07-12 15:23:34,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301698588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:34,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:34,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:23:34,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702459173] [2022-07-12 15:23:34,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:34,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:23:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:34,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:23:34,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:23:34,062 INFO L87 Difference]: Start difference. First operand 25845 states and 37473 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 15:23:36,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 15:23:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:43,281 INFO L93 Difference]: Finished difference Result 25961 states and 37678 transitions. [2022-07-12 15:23:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:23:43,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 199 [2022-07-12 15:23:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:43,417 INFO L225 Difference]: With dead ends: 25961 [2022-07-12 15:23:43,417 INFO L226 Difference]: Without dead ends: 25743 [2022-07-12 15:23:43,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 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:43,440 INFO L413 NwaCegarLoop]: 2498 mSDtfsCounter, 2650 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4218 mSolverCounterSat, 1740 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2904 SdHoareTripleChecker+Valid, 5473 SdHoareTripleChecker+Invalid, 5958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1740 IncrementalHoareTripleChecker+Valid, 4218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:43,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2904 Valid, 5473 Invalid, 5958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1740 Valid, 4218 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-07-12 15:23:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25743 states. [2022-07-12 15:23:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25743 to 25627. [2022-07-12 15:23:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25627 states, 15493 states have (on average 1.2520493125927838) internal successors, (19398), 15810 states have internal predecessors, (19398), 8837 states have call successors, (8837), 1295 states have call predecessors, (8837), 1295 states have return successors, (8945), 8653 states have call predecessors, (8945), 8837 states have call successors, (8945) [2022-07-12 15:23:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25627 states to 25627 states and 37180 transitions. [2022-07-12 15:23:45,258 INFO L78 Accepts]: Start accepts. Automaton has 25627 states and 37180 transitions. Word has length 199 [2022-07-12 15:23:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:23:45,259 INFO L495 AbstractCegarLoop]: Abstraction has 25627 states and 37180 transitions. [2022-07-12 15:23:45,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 15:23:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 25627 states and 37180 transitions. [2022-07-12 15:23:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-12 15:23:45,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:23:45,267 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:23:45,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 15:23:45,267 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 15:23:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:23:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 842221792, now seen corresponding path program 1 times [2022-07-12 15:23:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:23:45,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075324790] [2022-07-12 15:23:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:23:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:23:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:23:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:23:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:23:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:23:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:23:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:23:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:23:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:23:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 15:23:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 15:23:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:23:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:23:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 15:23:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 15:23:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 15:23:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:23:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 15:23:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 15:23:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 15:23:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 15:23:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 15:23:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-12 15:23:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:23:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-07-12 15:23:45,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:23:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075324790] [2022-07-12 15:23:45,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075324790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:23:45,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:23:45,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:23:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359069520] [2022-07-12 15:23:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:23:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:23:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:23:45,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:23:45,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:23:45,521 INFO L87 Difference]: Start difference. First operand 25627 states and 37180 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 15:23:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:23:59,313 INFO L93 Difference]: Finished difference Result 60782 states and 88375 transitions. [2022-07-12 15:23:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:23:59,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 219 [2022-07-12 15:23:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:23:59,653 INFO L225 Difference]: With dead ends: 60782 [2022-07-12 15:23:59,653 INFO L226 Difference]: Without dead ends: 35211 [2022-07-12 15:23:59,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 15:23:59,722 INFO L413 NwaCegarLoop]: 3976 mSDtfsCounter, 2627 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 3508 mSolverCounterSat, 2784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3110 SdHoareTripleChecker+Valid, 6132 SdHoareTripleChecker+Invalid, 6292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2784 IncrementalHoareTripleChecker+Valid, 3508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:23:59,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3110 Valid, 6132 Invalid, 6292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2784 Valid, 3508 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2022-07-12 15:23:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35211 states. [2022-07-12 15:24:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35211 to 34849. [2022-07-12 15:24:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34849 states, 20973 states have (on average 1.2517999332475087) internal successors, (26254), 21378 states have internal predecessors, (26254), 12099 states have call successors, (12099), 1775 states have call predecessors, (12099), 1775 states have return successors, (12207), 11873 states have call predecessors, (12207), 12099 states have call successors, (12207) [2022-07-12 15:24:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34849 states to 34849 states and 50560 transitions. [2022-07-12 15:24:01,783 INFO L78 Accepts]: Start accepts. Automaton has 34849 states and 50560 transitions. Word has length 219 [2022-07-12 15:24:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:24:01,784 INFO L495 AbstractCegarLoop]: Abstraction has 34849 states and 50560 transitions. [2022-07-12 15:24:01,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 15:24:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 34849 states and 50560 transitions. [2022-07-12 15:24:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-07-12 15:24:01,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:24:01,790 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:01,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 15:24:01,790 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 15:24:01,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:24:01,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1251657916, now seen corresponding path program 1 times [2022-07-12 15:24:01,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:24:01,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190200429] [2022-07-12 15:24:01,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:24:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:24:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:24:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:24:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:24:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:24:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:24:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:24:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:24:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:24:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:24:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 15:24:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 15:24:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:24:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 15:24:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:24:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 15:24:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 15:24:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 15:24:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 15:24:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 15:24:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 15:24:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 15:24:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 15:24:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 15:24:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:24:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 15:24:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 15:24:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 15:24:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 15:24:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 15:24:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-12 15:24:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2022-07-12 15:24:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:24:02,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190200429] [2022-07-12 15:24:02,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190200429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:24:02,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:24:02,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:24:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68612236] [2022-07-12 15:24:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:24:02,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:24:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:24:02,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:24:02,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:24:02,250 INFO L87 Difference]: Start difference. First operand 34849 states and 50560 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 15:24:06,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 15:24:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:24:15,935 INFO L93 Difference]: Finished difference Result 79283 states and 115219 transitions. [2022-07-12 15:24:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:24:15,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 292 [2022-07-12 15:24:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:24:16,165 INFO L225 Difference]: With dead ends: 79283 [2022-07-12 15:24:16,165 INFO L226 Difference]: Without dead ends: 44447 [2022-07-12 15:24:16,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 15:24:16,275 INFO L413 NwaCegarLoop]: 3980 mSDtfsCounter, 2625 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 3503 mSolverCounterSat, 2780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3108 SdHoareTripleChecker+Valid, 6153 SdHoareTripleChecker+Invalid, 6283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2780 IncrementalHoareTripleChecker+Valid, 3503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-12 15:24:16,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3108 Valid, 6153 Invalid, 6283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2780 Valid, 3503 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-07-12 15:24:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44447 states. [2022-07-12 15:24:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44447 to 43993. [2022-07-12 15:24:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43993 states, 26382 states have (on average 1.2519141839132741) internal successors, (33028), 26875 states have internal predecessors, (33028), 15358 states have call successors, (15358), 2251 states have call predecessors, (15358), 2251 states have return successors, (15466), 15090 states have call predecessors, (15466), 15358 states have call successors, (15466) [2022-07-12 15:24:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43993 states to 43993 states and 63852 transitions. [2022-07-12 15:24:19,508 INFO L78 Accepts]: Start accepts. Automaton has 43993 states and 63852 transitions. Word has length 292 [2022-07-12 15:24:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:24:19,509 INFO L495 AbstractCegarLoop]: Abstraction has 43993 states and 63852 transitions. [2022-07-12 15:24:19,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 15:24:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 43993 states and 63852 transitions. [2022-07-12 15:24:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-12 15:24:19,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:24:19,516 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:19,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 15:24:19,517 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 15:24:19,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:24:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash -647184797, now seen corresponding path program 1 times [2022-07-12 15:24:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:24:19,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889668386] [2022-07-12 15:24:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:24:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:24:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:24:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:24:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:24:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:24:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:24:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 15:24:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 15:24:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 15:24:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 15:24:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 15:24:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 15:24:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:24:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 15:24:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 15:24:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 15:24:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 15:24:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 15:24:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:24:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 15:24:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 15:24:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 15:24:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 15:24:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-12 15:24:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 15:24:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:24:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 15:24:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 15:24:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 15:24:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 15:24:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-12 15:24:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-12 15:24:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:24:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2022-07-12 15:24:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:24:19,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889668386] [2022-07-12 15:24:19,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889668386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:24:19,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:24:19,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:24:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19396214] [2022-07-12 15:24:19,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:24:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:24:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:24:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:24:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:24:19,849 INFO L87 Difference]: Start difference. First operand 43993 states and 63852 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 15:24:22,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 15:24:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:24:37,027 INFO L93 Difference]: Finished difference Result 98912 states and 143551 transitions. [2022-07-12 15:24:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:24:37,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 293 [2022-07-12 15:24:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:24:37,477 INFO L225 Difference]: With dead ends: 98912 [2022-07-12 15:24:37,477 INFO L226 Difference]: Without dead ends: 54975 [2022-07-12 15:24:37,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 15:24:37,628 INFO L413 NwaCegarLoop]: 4103 mSDtfsCounter, 2453 mSDsluCounter, 2883 mSDsCounter, 0 mSdLazyCounter, 4157 mSolverCounterSat, 1678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3044 SdHoareTripleChecker+Valid, 6986 SdHoareTripleChecker+Invalid, 5835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1678 IncrementalHoareTripleChecker+Valid, 4157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:24:37,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3044 Valid, 6986 Invalid, 5835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1678 Valid, 4157 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2022-07-12 15:24:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54975 states.