./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:11:09,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:11:09,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:11:09,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:11:09,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:11:09,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:11:09,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:11:09,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:11:09,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:11:09,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:11:09,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:11:09,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:11:09,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:11:09,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:11:09,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:11:09,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:11:09,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:11:09,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:11:09,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:11:09,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:11:09,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:11:09,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:11:09,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:11:09,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:11:09,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:11:09,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:11:09,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:11:09,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:11:09,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:11:09,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:11:09,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:11:09,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:11:09,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:11:09,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:11:09,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:11:09,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:11:09,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:11:09,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:11:09,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:11:09,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:11:09,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:11:09,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:11:09,828 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:11:09,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:11:09,834 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:11:09,834 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:11:09,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:11:09,835 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:11:09,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:11:09,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:11:09,836 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:11:09,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:11:09,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:11:09,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:11:09,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:11:09,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:11:09,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:11:09,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:11:09,839 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:11:09,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:11:09,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:11:09,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:11:09,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:11:09,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:09,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:11:09,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:11:09,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:11:09,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:11:09,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:11:09,842 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:11:09,842 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:11:09,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:11:09,844 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc 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-11-02 21:11:10,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:11:10,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:11:10,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:11:10,176 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:11:10,176 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:11:10,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i [2022-11-02 21:11:10,258 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/data/b5bca161d/3d02ce7185e542be925eda39b9ce1725/FLAG7fd51e1f0 [2022-11-02 21:11:11,342 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:11:11,343 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i [2022-11-02 21:11:11,397 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/data/b5bca161d/3d02ce7185e542be925eda39b9ce1725/FLAG7fd51e1f0 [2022-11-02 21:11:11,657 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/data/b5bca161d/3d02ce7185e542be925eda39b9ce1725 [2022-11-02 21:11:11,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:11:11,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:11:11,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:11,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:11:11,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:11:11,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4c7f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11, skipping insertion in model container [2022-11-02 21:11:11,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:11:11,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:11:14,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/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-11-02 21:11:14,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/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-11-02 21:11:14,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/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-11-02 21:11:14,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/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-11-02 21:11:14,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:14,821 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:11:15,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/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-11-02 21:11:15,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/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-11-02 21:11:15,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/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-11-02 21:11:15,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/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-11-02 21:11:15,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:15,369 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:11:15,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15 WrapperNode [2022-11-02 21:11:15,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:15,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:15,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:11:15,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:11:15,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,613 INFO L138 Inliner]: procedures = 395, calls = 2038, calls flagged for inlining = 159, calls inlined = 138, statements flattened = 4304 [2022-11-02 21:11:15,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:15,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:11:15,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:11:15,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:11:15,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,863 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:11:15,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:11:15,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:11:15,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:11:15,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (1/1) ... [2022-11-02 21:11:15,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:15,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:15,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:15,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bb16e46-ec58-4ade-a46e-a4a715bc2af3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:11:16,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 21:11:16,017 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 21:11:16,017 INFO L130 BoogieDeclarations]: Found specification of procedure RxCurCount [2022-11-02 21:11:16,018 INFO L138 BoogieDeclarations]: Found implementation of procedure RxCurCount [2022-11-02 21:11:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure irda_setup_dma [2022-11-02 21:11:16,018 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_setup_dma [2022-11-02 21:11:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-11-02 21:11:16,018 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-11-02 21:11:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 21:11:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 21:11:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_73 [2022-11-02 21:11:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_73 [2022-11-02 21:11:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-11-02 21:11:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-11-02 21:11:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure CheckRegBit [2022-11-02 21:11:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckRegBit [2022-11-02 21:11:16,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 21:11:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 21:11:16,020 INFO L130 BoogieDeclarations]: Found specification of procedure via_remove_one [2022-11-02 21:11:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure via_remove_one [2022-11-02 21:11:16,020 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_change_speed [2022-11-02 21:11:16,020 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_change_speed [2022-11-02 21:11:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure dma_zalloc_coherent [2022-11-02 21:11:16,021 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_zalloc_coherent [2022-11-02 21:11:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-02 21:11:16,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-02 21:11:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure SetPulseWidth [2022-11-02 21:11:16,021 INFO L138 BoogieDeclarations]: Found implementation of procedure SetPulseWidth [2022-11-02 21:11:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure Tdelay [2022-11-02 21:11:16,022 INFO L138 BoogieDeclarations]: Found implementation of procedure Tdelay [2022-11-02 21:11:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-11-02 21:11:16,022 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-11-02 21:11:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-02 21:11:16,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-02 21:11:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:11:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure ClkTx [2022-11-02 21:11:16,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ClkTx [2022-11-02 21:11:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure WriteLPCReg [2022-11-02 21:11:16,024 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteLPCReg [2022-11-02 21:11:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-11-02 21:11:16,024 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-11-02 21:11:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure CommonInit [2022-11-02 21:11:16,025 INFO L138 BoogieDeclarations]: Found implementation of procedure CommonInit [2022-11-02 21:11:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-02 21:11:16,025 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-02 21:11:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_change_dongle_speed [2022-11-02 21:11:16,026 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_change_dongle_speed [2022-11-02 21:11:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure ReadLPCReg [2022-11-02 21:11:16,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadLPCReg [2022-11-02 21:11:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 21:11:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure free_dma [2022-11-02 21:11:16,028 INFO L138 BoogieDeclarations]: Found implementation of procedure free_dma [2022-11-02 21:11:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_via_ircc_cb [2022-11-02 21:11:16,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_via_ircc_cb [2022-11-02 21:11:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_dma_receive [2022-11-02 21:11:16,030 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_dma_receive [2022-11-02 21:11:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-11-02 21:11:16,030 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-11-02 21:11:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 21:11:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-02 21:11:16,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-02 21:11:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_net_close [2022-11-02 21:11:16,032 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_net_close [2022-11-02 21:11:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:11:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 21:11:16,033 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 21:11:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure CkRxRecv [2022-11-02 21:11:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure CkRxRecv [2022-11-02 21:11:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-11-02 21:11:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-11-02 21:11:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-11-02 21:11:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-11-02 21:11:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure irda_get_next_speed [2022-11-02 21:11:16,035 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_get_next_speed [2022-11-02 21:11:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure ReadReg [2022-11-02 21:11:16,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadReg [2022-11-02 21:11:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_open [2022-11-02 21:11:16,035 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_open [2022-11-02 21:11:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-11-02 21:11:16,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-11-02 21:11:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure WriteRegBit [2022-11-02 21:11:16,036 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteRegBit [2022-11-02 21:11:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:11:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2022-11-02 21:11:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2022-11-02 21:11:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure Wr_Indx [2022-11-02 21:11:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure Wr_Indx [2022-11-02 21:11:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:11:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 21:11:16,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 21:11:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-02 21:11:16,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-02 21:11:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:11:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:11:16,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:11:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 21:11:16,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 21:11:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure WriteReg [2022-11-02 21:11:16,040 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteReg [2022-11-02 21:11:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-11-02 21:11:16,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-11-02 21:11:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 21:11:16,041 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 21:11:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure SetBaudRate [2022-11-02 21:11:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure SetBaudRate [2022-11-02 21:11:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure Wr_Byte [2022-11-02 21:11:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure Wr_Byte [2022-11-02 21:11:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-02 21:11:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-02 21:11:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-11-02 21:11:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-11-02 21:11:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_net_open [2022-11-02 21:11:16,044 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_net_open [2022-11-02 21:11:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:11:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:11:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure ResetChip [2022-11-02 21:11:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ResetChip [2022-11-02 21:11:16,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 21:11:16,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 21:11:16,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 21:11:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 21:11:16,050 INFO L130 BoogieDeclarations]: Found specification of procedure irda_device_txqueue_empty [2022-11-02 21:11:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_device_txqueue_empty [2022-11-02 21:11:16,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 21:11:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 21:11:16,057 INFO L130 BoogieDeclarations]: Found specification of procedure pci_read_config_byte [2022-11-02 21:11:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_read_config_byte [2022-11-02 21:11:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure Sdelay [2022-11-02 21:11:16,058 INFO L138 BoogieDeclarations]: Found implementation of procedure Sdelay [2022-11-02 21:11:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure SetSIR [2022-11-02 21:11:16,058 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSIR [2022-11-02 21:11:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-02 21:11:16,059 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-02 21:11:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure SetMaxRxPacketSize [2022-11-02 21:11:16,059 INFO L138 BoogieDeclarations]: Found implementation of procedure SetMaxRxPacketSize [2022-11-02 21:11:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure GetRecvByte [2022-11-02 21:11:16,059 INFO L138 BoogieDeclarations]: Found implementation of procedure GetRecvByte [2022-11-02 21:11:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-02 21:11:16,059 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-02 21:11:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:11:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:11:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure hwreset [2022-11-02 21:11:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure hwreset [2022-11-02 21:11:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:11:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-11-02 21:11:16,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-11-02 21:11:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2022-11-02 21:11:16,061 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2022-11-02 21:11:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-02 21:11:16,061 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-02 21:11:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-11-02 21:11:16,061 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-11-02 21:11:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-02 21:11:16,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-02 21:11:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-11-02 21:11:16,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-11-02 21:11:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_dma_xmit [2022-11-02 21:11:16,062 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_dma_xmit [2022-11-02 21:11:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-11-02 21:11:16,062 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-11-02 21:11:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2022-11-02 21:11:16,063 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2022-11-02 21:11:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-02 21:11:16,063 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-02 21:11:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-02 21:11:16,063 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-02 21:11:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-11-02 21:11:16,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-11-02 21:11:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:11:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure net_ratelimit [2022-11-02 21:11:16,064 INFO L138 BoogieDeclarations]: Found implementation of procedure net_ratelimit [2022-11-02 21:11:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure SetSendByte [2022-11-02 21:11:16,064 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSendByte [2022-11-02 21:11:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-11-02 21:11:16,064 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-11-02 21:11:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 21:11:16,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 21:11:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_via_ircc_cb [2022-11-02 21:11:16,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_via_ircc_cb [2022-11-02 21:11:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure SetSendPreambleCount [2022-11-02 21:11:16,065 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSendPreambleCount [2022-11-02 21:11:16,066 INFO L130 BoogieDeclarations]: Found specification of procedure InitCard [2022-11-02 21:11:16,066 INFO L138 BoogieDeclarations]: Found implementation of procedure InitCard [2022-11-02 21:11:16,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-02 21:11:16,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-02 21:11:16,067 INFO L130 BoogieDeclarations]: Found specification of procedure SetTimer [2022-11-02 21:11:16,068 INFO L138 BoogieDeclarations]: Found implementation of procedure SetTimer [2022-11-02 21:11:16,068 INFO L130 BoogieDeclarations]: Found specification of procedure ActClk [2022-11-02 21:11:16,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ActClk [2022-11-02 21:11:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure request_dma [2022-11-02 21:11:16,069 INFO L138 BoogieDeclarations]: Found implementation of procedure request_dma [2022-11-02 21:11:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-11-02 21:11:16,069 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-11-02 21:11:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:11:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-11-02 21:11:16,070 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-11-02 21:11:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-11-02 21:11:16,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-11-02 21:11:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_to_linear_data [2022-11-02 21:11:16,070 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_to_linear_data [2022-11-02 21:11:16,846 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:11:16,854 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:11:17,072 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 21:11:20,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-11-02 21:11:21,583 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:11:21,611 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:11:21,612 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:11:21,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:21 BoogieIcfgContainer [2022-11-02 21:11:21,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:11:21,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:11:21,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:11:21,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:11:21,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:11:11" (1/3) ... [2022-11-02 21:11:21,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b735d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:21, skipping insertion in model container [2022-11-02 21:11:21,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:15" (2/3) ... [2022-11-02 21:11:21,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b735d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:21, skipping insertion in model container [2022-11-02 21:11:21,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:21" (3/3) ... [2022-11-02 21:11:21,632 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i [2022-11-02 21:11:21,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:11:21,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-02 21:11:21,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:11:21,800 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b02cc6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:11:21,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-02 21:11:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 1916 states, 1168 states have (on average 1.2671232876712328) internal successors, (1480), 1194 states have internal predecessors, (1480), 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-11-02 21:11:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-02 21:11:21,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:21,829 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-11-02 21:11:21,830 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-11-02 21:11:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1683585667, now seen corresponding path program 1 times [2022-11-02 21:11:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:21,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615052185] [2022-11-02 21:11:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:11:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:11:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:11:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:11:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:11:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:11:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:11:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-02 21:11:22,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:22,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615052185] [2022-11-02 21:11:22,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615052185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:22,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:22,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:11:22,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502190432] [2022-11-02 21:11:22,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:22,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:11:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:22,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:11:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:11:22,834 INFO L87 Difference]: Start difference. First operand has 1916 states, 1168 states have (on average 1.2671232876712328) internal successors, (1480), 1194 states have internal predecessors, (1480), 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-11-02 21:11:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:31,540 INFO L93 Difference]: Finished difference Result 5668 states and 8310 transitions. [2022-11-02 21:11:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:11:31,542 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-11-02 21:11:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:31,582 INFO L225 Difference]: With dead ends: 5668 [2022-11-02 21:11:31,582 INFO L226 Difference]: Without dead ends: 3758 [2022-11-02 21:11:31,599 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-11-02 21:11:31,602 INFO L413 NwaCegarLoop]: 2688 mSDtfsCounter, 3173 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 3004 mSolverCounterSat, 2339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3794 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 5343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2339 IncrementalHoareTripleChecker+Valid, 3004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:31,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3794 Valid, 4478 Invalid, 5343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2339 Valid, 3004 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-02 21:11:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2022-11-02 21:11:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3726. [2022-11-02 21:11:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 2276 states have (on average 1.2640597539543057) internal successors, (2877), 2326 states have internal predecessors, (2877), 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-11-02 21:11:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 5410 transitions. [2022-11-02 21:11:31,970 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 5410 transitions. Word has length 79 [2022-11-02 21:11:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:31,971 INFO L495 AbstractCegarLoop]: Abstraction has 3726 states and 5410 transitions. [2022-11-02 21:11:31,971 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-11-02 21:11:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 5410 transitions. [2022-11-02 21:11:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 21:11:31,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:31,976 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-11-02 21:11:31,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:11:31,976 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-11-02 21:11:31,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash 133917900, now seen corresponding path program 1 times [2022-11-02 21:11:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:31,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254428770] [2022-11-02 21:11:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:11:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:11:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:11:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:11:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:11:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:11:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:11:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-02 21:11:32,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:32,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254428770] [2022-11-02 21:11:32,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254428770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:32,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:32,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:11:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658393705] [2022-11-02 21:11:32,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:32,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:11:32,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:11:32,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:11:32,362 INFO L87 Difference]: Start difference. First operand 3726 states and 5410 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-11-02 21:11:35,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:11:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:41,463 INFO L93 Difference]: Finished difference Result 10364 states and 15087 transitions. [2022-11-02 21:11:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:11:41,464 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-11-02 21:11:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:41,525 INFO L225 Difference]: With dead ends: 10364 [2022-11-02 21:11:41,525 INFO L226 Difference]: Without dead ends: 6653 [2022-11-02 21:11:41,551 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-11-02 21:11:41,552 INFO L413 NwaCegarLoop]: 2651 mSDtfsCounter, 2655 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 2132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3199 SdHoareTripleChecker+Valid, 4472 SdHoareTripleChecker+Invalid, 5017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2132 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:41,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3199 Valid, 4472 Invalid, 5017 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2132 Valid, 2885 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-11-02 21:11:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2022-11-02 21:11:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 6584. [2022-11-02 21:11:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 3985 states have (on average 1.256210790464241) internal successors, (5006), 4085 states have internal predecessors, (5006), 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-11-02 21:11:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 9575 transitions. [2022-11-02 21:11:42,147 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 9575 transitions. Word has length 83 [2022-11-02 21:11:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:42,148 INFO L495 AbstractCegarLoop]: Abstraction has 6584 states and 9575 transitions. [2022-11-02 21:11:42,148 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-11-02 21:11:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 9575 transitions. [2022-11-02 21:11:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-02 21:11:42,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:42,151 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-11-02 21:11:42,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:11:42,152 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-11-02 21:11:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 593600064, now seen corresponding path program 1 times [2022-11-02 21:11:42,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:42,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039345255] [2022-11-02 21:11:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:11:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:11:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:11:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:11:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:11:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:11:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:11:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-02 21:11:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:42,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039345255] [2022-11-02 21:11:42,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039345255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:42,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:42,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:11:42,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804626239] [2022-11-02 21:11:42,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:42,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:11:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:42,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:11:42,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:11:42,529 INFO L87 Difference]: Start difference. First operand 6584 states and 9575 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-11-02 21:11:48,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:11:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:51,642 INFO L93 Difference]: Finished difference Result 18862 states and 27498 transitions. [2022-11-02 21:11:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:11:51,644 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-11-02 21:11:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:51,758 INFO L225 Difference]: With dead ends: 18862 [2022-11-02 21:11:51,758 INFO L226 Difference]: Without dead ends: 12293 [2022-11-02 21:11:51,851 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-11-02 21:11:51,852 INFO L413 NwaCegarLoop]: 2655 mSDtfsCounter, 3007 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 2339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3580 SdHoareTripleChecker+Valid, 4451 SdHoareTripleChecker+Invalid, 5302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2339 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:51,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3580 Valid, 4451 Invalid, 5302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2339 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-11-02 21:11:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12293 states. [2022-11-02 21:11:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12293 to 12188. [2022-11-02 21:11:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12188 states, 7367 states have (on average 1.2547848513641917) internal successors, (9244), 7569 states have internal predecessors, (9244), 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-11-02 21:11:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12188 states to 12188 states and 17743 transitions. [2022-11-02 21:11:52,790 INFO L78 Accepts]: Start accepts. Automaton has 12188 states and 17743 transitions. Word has length 87 [2022-11-02 21:11:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:52,791 INFO L495 AbstractCegarLoop]: Abstraction has 12188 states and 17743 transitions. [2022-11-02 21:11:52,791 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-11-02 21:11:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 12188 states and 17743 transitions. [2022-11-02 21:11:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 21:11:52,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:52,796 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-11-02 21:11:52,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:11:52,796 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-11-02 21:11:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1823001785, now seen corresponding path program 1 times [2022-11-02 21:11:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:52,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101325504] [2022-11-02 21:11:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:11:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:11:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:11:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:11:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:11:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:11:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:11:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:11:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:11:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:11:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:11:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:11:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:11:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-11-02 21:11:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:53,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101325504] [2022-11-02 21:11:53,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101325504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:53,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:53,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:11:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915765735] [2022-11-02 21:11:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:53,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:11:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:53,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:11:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:11:53,133 INFO L87 Difference]: Start difference. First operand 12188 states and 17743 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-11-02 21:11:55,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:02,061 INFO L93 Difference]: Finished difference Result 24525 states and 35731 transitions. [2022-11-02 21:12:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:12:02,063 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-11-02 21:12:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:02,218 INFO L225 Difference]: With dead ends: 24525 [2022-11-02 21:12:02,218 INFO L226 Difference]: Without dead ends: 18302 [2022-11-02 21:12:02,265 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-11-02 21:12:02,266 INFO L413 NwaCegarLoop]: 4702 mSDtfsCounter, 2445 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 1755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 4792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1755 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:02,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 7178 Invalid, 4792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1755 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-02 21:12:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18302 states. [2022-11-02 21:12:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18302 to 18182. [2022-11-02 21:12:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18182 states, 10985 states have (on average 1.2548020027309967) internal successors, (13784), 11283 states have internal predecessors, (13784), 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-11-02 21:12:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18182 states to 18182 states and 26469 transitions. [2022-11-02 21:12:03,588 INFO L78 Accepts]: Start accepts. Automaton has 18182 states and 26469 transitions. Word has length 134 [2022-11-02 21:12:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:03,589 INFO L495 AbstractCegarLoop]: Abstraction has 18182 states and 26469 transitions. [2022-11-02 21:12:03,589 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-11-02 21:12:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 18182 states and 26469 transitions. [2022-11-02 21:12:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 21:12:03,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:03,594 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-11-02 21:12:03,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:12:03,595 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-11-02 21:12:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1400299959, now seen corresponding path program 1 times [2022-11-02 21:12:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:03,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731685827] [2022-11-02 21:12:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:03,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:12:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:12:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:12:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:12:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:12:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:12:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:12:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:12:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:12:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:12:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:12:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-11-02 21:12:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:04,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731685827] [2022-11-02 21:12:04,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731685827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:04,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:04,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:12:04,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781694635] [2022-11-02 21:12:04,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:04,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:12:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:12:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:12:04,427 INFO L87 Difference]: Start difference. First operand 18182 states and 26469 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-11-02 21:12:07,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:08,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:13,745 INFO L93 Difference]: Finished difference Result 18284 states and 26665 transitions. [2022-11-02 21:12:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:12:13,746 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-11-02 21:12:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:13,914 INFO L225 Difference]: With dead ends: 18284 [2022-11-02 21:12:13,914 INFO L226 Difference]: Without dead ends: 18282 [2022-11-02 21:12:13,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:12:13,926 INFO L413 NwaCegarLoop]: 2390 mSDtfsCounter, 2479 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 5272 SdHoareTripleChecker+Invalid, 5822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1753 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:13,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 5272 Invalid, 5822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1753 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-11-02 21:12:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18282 states. [2022-11-02 21:12:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18282 to 18186. [2022-11-02 21:12:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18186 states, 10988 states have (on average 1.2547324353840554) internal successors, (13787), 11286 states have internal predecessors, (13787), 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-11-02 21:12:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18186 states to 18186 states and 26472 transitions. [2022-11-02 21:12:15,287 INFO L78 Accepts]: Start accepts. Automaton has 18186 states and 26472 transitions. Word has length 134 [2022-11-02 21:12:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:15,288 INFO L495 AbstractCegarLoop]: Abstraction has 18186 states and 26472 transitions. [2022-11-02 21:12:15,288 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-11-02 21:12:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18186 states and 26472 transitions. [2022-11-02 21:12:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 21:12:15,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:15,293 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-11-02 21:12:15,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:12:15,294 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-11-02 21:12:15,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1077871985, now seen corresponding path program 1 times [2022-11-02 21:12:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:15,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375269821] [2022-11-02 21:12:15,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:12:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:12:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:12:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:12:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:12:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:12:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:12:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:12:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:12:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:12:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:12:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 21:12:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-11-02 21:12:15,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:15,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375269821] [2022-11-02 21:12:15,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375269821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:15,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:15,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:12:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578308477] [2022-11-02 21:12:15,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:15,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:12:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:12:15,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:12:15,915 INFO L87 Difference]: Start difference. First operand 18186 states and 26472 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-11-02 21:12:19,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:24,442 INFO L93 Difference]: Finished difference Result 18288 states and 26668 transitions. [2022-11-02 21:12:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:12:24,442 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-11-02 21:12:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:24,564 INFO L225 Difference]: With dead ends: 18288 [2022-11-02 21:12:24,564 INFO L226 Difference]: Without dead ends: 18286 [2022-11-02 21:12:24,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:12:24,582 INFO L413 NwaCegarLoop]: 2394 mSDtfsCounter, 2471 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 5821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1752 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:24,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 5279 Invalid, 5821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1752 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-11-02 21:12:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18286 states. [2022-11-02 21:12:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18286 to 18190. [2022-11-02 21:12:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18190 states, 10991 states have (on average 1.2546629060140115) internal successors, (13790), 11289 states have internal predecessors, (13790), 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-11-02 21:12:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18190 states to 18190 states and 26475 transitions. [2022-11-02 21:12:26,025 INFO L78 Accepts]: Start accepts. Automaton has 18190 states and 26475 transitions. Word has length 139 [2022-11-02 21:12:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:26,026 INFO L495 AbstractCegarLoop]: Abstraction has 18190 states and 26475 transitions. [2022-11-02 21:12:26,026 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-11-02 21:12:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 18190 states and 26475 transitions. [2022-11-02 21:12:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-02 21:12:26,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:26,031 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-11-02 21:12:26,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:12:26,031 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-11-02 21:12:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:26,032 INFO L85 PathProgramCache]: Analyzing trace with hash 696282889, now seen corresponding path program 1 times [2022-11-02 21:12:26,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:26,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142227102] [2022-11-02 21:12:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:26,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:12:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:12:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:12:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:12:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:12:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:12:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:12:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:12:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:12:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:12:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:12:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 21:12:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:12:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-11-02 21:12:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142227102] [2022-11-02 21:12:26,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142227102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:26,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:26,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:12:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999485110] [2022-11-02 21:12:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:26,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:12:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:26,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:12:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:12:26,561 INFO L87 Difference]: Start difference. First operand 18190 states and 26475 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-11-02 21:12:29,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:31,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:36,747 INFO L93 Difference]: Finished difference Result 18292 states and 26671 transitions. [2022-11-02 21:12:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:12:36,751 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-11-02 21:12:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:36,876 INFO L225 Difference]: With dead ends: 18292 [2022-11-02 21:12:36,876 INFO L226 Difference]: Without dead ends: 18290 [2022-11-02 21:12:36,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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-11-02 21:12:36,889 INFO L413 NwaCegarLoop]: 2393 mSDtfsCounter, 2471 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1751 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 5275 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1751 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:36,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 5275 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1751 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-11-02 21:12:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18290 states. [2022-11-02 21:12:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18290 to 18194. [2022-11-02 21:12:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18194 states, 10994 states have (on average 1.2545934145897761) internal successors, (13793), 11292 states have internal predecessors, (13793), 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-11-02 21:12:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18194 states to 18194 states and 26478 transitions. [2022-11-02 21:12:38,421 INFO L78 Accepts]: Start accepts. Automaton has 18194 states and 26478 transitions. Word has length 144 [2022-11-02 21:12:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:38,422 INFO L495 AbstractCegarLoop]: Abstraction has 18194 states and 26478 transitions. [2022-11-02 21:12:38,422 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-11-02 21:12:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 18194 states and 26478 transitions. [2022-11-02 21:12:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-02 21:12:38,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:38,433 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-11-02 21:12:38,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:12:38,434 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-11-02 21:12:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash 288775217, now seen corresponding path program 1 times [2022-11-02 21:12:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:38,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554519249] [2022-11-02 21:12:38,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:12:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:12:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:12:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:12:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:12:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:12:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:12:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:12:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:12:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:12:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:12:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 21:12:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:12:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 21:12:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-02 21:12:38,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:38,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554519249] [2022-11-02 21:12:38,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554519249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:38,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:38,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:12:38,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115312544] [2022-11-02 21:12:38,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:38,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:12:38,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:12:38,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:12:38,993 INFO L87 Difference]: Start difference. First operand 18194 states and 26478 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-11-02 21:12:41,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:47,574 INFO L93 Difference]: Finished difference Result 18296 states and 26674 transitions. [2022-11-02 21:12:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:12:47,575 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-11-02 21:12:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:47,654 INFO L225 Difference]: With dead ends: 18296 [2022-11-02 21:12:47,655 INFO L226 Difference]: Without dead ends: 18294 [2022-11-02 21:12:47,665 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-11-02 21:12:47,666 INFO L413 NwaCegarLoop]: 2394 mSDtfsCounter, 2471 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 5819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1750 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:47,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 5279 Invalid, 5819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1750 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-02 21:12:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18294 states. [2022-11-02 21:12:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18294 to 18198. [2022-11-02 21:12:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18198 states, 10997 states have (on average 1.2545239610802947) internal successors, (13796), 11295 states have internal predecessors, (13796), 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-11-02 21:12:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18198 states to 18198 states and 26481 transitions. [2022-11-02 21:12:49,146 INFO L78 Accepts]: Start accepts. Automaton has 18198 states and 26481 transitions. Word has length 149 [2022-11-02 21:12:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:49,147 INFO L495 AbstractCegarLoop]: Abstraction has 18198 states and 26481 transitions. [2022-11-02 21:12:49,148 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-11-02 21:12:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 18198 states and 26481 transitions. [2022-11-02 21:12:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-02 21:12:49,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:49,155 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-11-02 21:12:49,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:12:49,156 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-11-02 21:12:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1670086601, now seen corresponding path program 1 times [2022-11-02 21:12:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:49,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79165824] [2022-11-02 21:12:49,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:12:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:12:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:12:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:12:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:12:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:12:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:12:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:12:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:12:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:12:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:12:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:12:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:12:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 21:12:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:12:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 21:12:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-02 21:12:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-11-02 21:12:49,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:49,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79165824] [2022-11-02 21:12:49,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79165824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:49,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:49,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:12:49,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135619155] [2022-11-02 21:12:49,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:49,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:12:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:12:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:12:49,700 INFO L87 Difference]: Start difference. First operand 18198 states and 26481 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-11-02 21:12:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:58,481 INFO L93 Difference]: Finished difference Result 18300 states and 26677 transitions. [2022-11-02 21:12:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:12:58,481 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-11-02 21:12:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:58,554 INFO L225 Difference]: With dead ends: 18300 [2022-11-02 21:12:58,555 INFO L226 Difference]: Without dead ends: 18298 [2022-11-02 21:12:58,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:12:58,565 INFO L413 NwaCegarLoop]: 2394 mSDtfsCounter, 2471 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 5818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:58,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 5279 Invalid, 5818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-02 21:12:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18298 states. [2022-11-02 21:12:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18298 to 18202. [2022-11-02 21:12:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18202 states, 11000 states have (on average 1.2544545454545455) internal successors, (13799), 11298 states have internal predecessors, (13799), 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-11-02 21:12:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18202 states to 18202 states and 26484 transitions. [2022-11-02 21:12:59,910 INFO L78 Accepts]: Start accepts. Automaton has 18202 states and 26484 transitions. Word has length 154 [2022-11-02 21:12:59,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:59,913 INFO L495 AbstractCegarLoop]: Abstraction has 18202 states and 26484 transitions. [2022-11-02 21:12:59,913 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-11-02 21:12:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 18202 states and 26484 transitions. [2022-11-02 21:12:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-02 21:12:59,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:59,920 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-11-02 21:12:59,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:12:59,920 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-11-02 21:12:59,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash -76418319, now seen corresponding path program 1 times [2022-11-02 21:12:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:59,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914271011] [2022-11-02 21:12:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:13:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:13:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:13:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:13:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:13:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:13:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:13:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:13:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:13:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:13:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:13:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 21:13:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:13:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 21:13:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-02 21:13:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 21:13:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-11-02 21:13:00,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:00,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914271011] [2022-11-02 21:13:00,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914271011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:00,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:00,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:13:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170768666] [2022-11-02 21:13:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:00,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:13:00,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:00,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:13:00,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:13:00,455 INFO L87 Difference]: Start difference. First operand 18202 states and 26484 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-11-02 21:13:03,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:04,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:11,218 INFO L93 Difference]: Finished difference Result 18304 states and 26680 transitions. [2022-11-02 21:13:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:13:11,223 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-11-02 21:13:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:11,297 INFO L225 Difference]: With dead ends: 18304 [2022-11-02 21:13:11,297 INFO L226 Difference]: Without dead ends: 18302 [2022-11-02 21:13:11,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:13:11,312 INFO L413 NwaCegarLoop]: 2393 mSDtfsCounter, 2471 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 5275 SdHoareTripleChecker+Invalid, 5817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1748 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:11,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 5275 Invalid, 5817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1748 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-11-02 21:13:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18302 states. [2022-11-02 21:13:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18302 to 18206. [2022-11-02 21:13:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18206 states, 11003 states have (on average 1.2543851676815414) internal successors, (13802), 11301 states have internal predecessors, (13802), 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-11-02 21:13:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18206 states to 18206 states and 26487 transitions. [2022-11-02 21:13:13,076 INFO L78 Accepts]: Start accepts. Automaton has 18206 states and 26487 transitions. Word has length 159 [2022-11-02 21:13:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:13,077 INFO L495 AbstractCegarLoop]: Abstraction has 18206 states and 26487 transitions. [2022-11-02 21:13:13,077 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-11-02 21:13:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 18206 states and 26487 transitions. [2022-11-02 21:13:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 21:13:13,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:13,083 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-11-02 21:13:13,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:13:13,083 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-11-02 21:13:13,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 925572861, now seen corresponding path program 1 times [2022-11-02 21:13:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:13,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857517928] [2022-11-02 21:13:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:13:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:13:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:13:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:13:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:13:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:13:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:13:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:13:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:13:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:13:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:13:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-02 21:13:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-02 21:13:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-11-02 21:13:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:13,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857517928] [2022-11-02 21:13:13,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857517928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:13,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:13,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:13:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660391170] [2022-11-02 21:13:13,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:13,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:13:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:13:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:13,645 INFO L87 Difference]: Start difference. First operand 18206 states and 26487 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-11-02 21:13:16,865 WARN L539 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-11-02 21:13:19,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:21,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:34,081 INFO L93 Difference]: Finished difference Result 37428 states and 54572 transitions. [2022-11-02 21:13:34,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:13:34,082 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-11-02 21:13:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:34,194 INFO L225 Difference]: With dead ends: 37428 [2022-11-02 21:13:34,194 INFO L226 Difference]: Without dead ends: 19237 [2022-11-02 21:13:34,308 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-11-02 21:13:34,309 INFO L413 NwaCegarLoop]: 2956 mSDtfsCounter, 3083 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 3365 mSolverCounterSat, 3467 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3583 SdHoareTripleChecker+Valid, 4788 SdHoareTripleChecker+Invalid, 6833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3467 IncrementalHoareTripleChecker+Valid, 3365 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:34,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3583 Valid, 4788 Invalid, 6833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3467 Valid, 3365 Invalid, 1 Unknown, 0 Unchecked, 18.1s Time] [2022-11-02 21:13:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19237 states. [2022-11-02 21:13:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19237 to 18929. [2022-11-02 21:13:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18929 states, 11395 states have (on average 1.2537955243527863) internal successors, (14287), 11675 states have internal predecessors, (14287), 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-11-02 21:13:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18929 states to 18929 states and 27480 transitions. [2022-11-02 21:13:36,536 INFO L78 Accepts]: Start accepts. Automaton has 18929 states and 27480 transitions. Word has length 156 [2022-11-02 21:13:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:36,537 INFO L495 AbstractCegarLoop]: Abstraction has 18929 states and 27480 transitions. [2022-11-02 21:13:36,537 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-11-02 21:13:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18929 states and 27480 transitions. [2022-11-02 21:13:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-02 21:13:36,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:36,543 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 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] [2022-11-02 21:13:36,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:13:36,543 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-11-02 21:13:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash -584639198, now seen corresponding path program 1 times [2022-11-02 21:13:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133958984] [2022-11-02 21:13:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:36,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:13:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:13:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:13:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:13:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:13:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:13:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:13:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:13:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:13:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:13:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:13:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 21:13:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:13:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 21:13:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 21:13:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 21:13:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 21:13:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-02 21:13:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 21:13:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-11-02 21:13:37,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:37,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133958984] [2022-11-02 21:13:37,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133958984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:37,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:37,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:13:37,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109551988] [2022-11-02 21:13:37,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:37,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:13:37,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:37,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:13:37,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:13:37,244 INFO L87 Difference]: Start difference. First operand 18929 states and 27480 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:13:40,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:42,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:49,496 INFO L93 Difference]: Finished difference Result 19043 states and 27686 transitions. [2022-11-02 21:13:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:13:49,497 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 184 [2022-11-02 21:13:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:49,575 INFO L225 Difference]: With dead ends: 19043 [2022-11-02 21:13:49,575 INFO L226 Difference]: Without dead ends: 19041 [2022-11-02 21:13:49,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:13:49,583 INFO L413 NwaCegarLoop]: 2394 mSDtfsCounter, 2460 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2711 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 5816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1747 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:49,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2711 Valid, 5279 Invalid, 5816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1747 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-11-02 21:13:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19041 states. [2022-11-02 21:13:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19041 to 18933. [2022-11-02 21:13:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18933 states, 11398 states have (on average 1.2537287243376032) internal successors, (14290), 11678 states have internal predecessors, (14290), 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-11-02 21:13:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18933 states to 18933 states and 27483 transitions. [2022-11-02 21:13:51,530 INFO L78 Accepts]: Start accepts. Automaton has 18933 states and 27483 transitions. Word has length 184 [2022-11-02 21:13:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:51,530 INFO L495 AbstractCegarLoop]: Abstraction has 18933 states and 27483 transitions. [2022-11-02 21:13:51,530 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:13:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 18933 states and 27483 transitions. [2022-11-02 21:13:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 21:13:51,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:51,534 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 7, 7, 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] [2022-11-02 21:13:51,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:13:51,534 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-11-02 21:13:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -878054216, now seen corresponding path program 1 times [2022-11-02 21:13:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:51,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652119011] [2022-11-02 21:13:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:51,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:13:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:13:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:13:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:13:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:13:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:13:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:13:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:13:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:13:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:13:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:13:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:13:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:13:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 21:13:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:13:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 21:13:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 21:13:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 21:13:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 21:13:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-02 21:13:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 21:13:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-02 21:13:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-11-02 21:13:52,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:52,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652119011] [2022-11-02 21:13:52,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652119011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:52,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:52,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:13:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108115946] [2022-11-02 21:13:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:52,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:13:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:52,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:13:52,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:13:52,193 INFO L87 Difference]: Start difference. First operand 18933 states and 27483 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, (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-11-02 21:14:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:02,104 INFO L93 Difference]: Finished difference Result 19047 states and 27689 transitions. [2022-11-02 21:14:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:14:02,105 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, (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 189 [2022-11-02 21:14:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:02,184 INFO L225 Difference]: With dead ends: 19047 [2022-11-02 21:14:02,184 INFO L226 Difference]: Without dead ends: 19045 [2022-11-02 21:14:02,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 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-11-02 21:14:02,194 INFO L413 NwaCegarLoop]: 2393 mSDtfsCounter, 2460 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2712 SdHoareTripleChecker+Valid, 5275 SdHoareTripleChecker+Invalid, 5815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1746 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:02,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2712 Valid, 5275 Invalid, 5815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1746 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-02 21:14:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19045 states. [2022-11-02 21:14:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19045 to 18937. [2022-11-02 21:14:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18937 states, 11401 states have (on average 1.253661959477239) internal successors, (14293), 11681 states have internal predecessors, (14293), 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-11-02 21:14:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18937 states to 18937 states and 27486 transitions. [2022-11-02 21:14:03,941 INFO L78 Accepts]: Start accepts. Automaton has 18937 states and 27486 transitions. Word has length 189 [2022-11-02 21:14:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:03,942 INFO L495 AbstractCegarLoop]: Abstraction has 18937 states and 27486 transitions. [2022-11-02 21:14:03,942 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, (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-11-02 21:14:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 18937 states and 27486 transitions. [2022-11-02 21:14:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-02 21:14:03,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:03,946 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 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] [2022-11-02 21:14:03,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:14:03,947 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-11-02 21:14:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1810046647, now seen corresponding path program 1 times [2022-11-02 21:14:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:03,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336199589] [2022-11-02 21:14:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:03,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:14:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:14:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:14:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:14:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:14:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:14:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:14:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:14:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:14:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:14:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:14:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:14:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:14:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 21:14:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:14:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 21:14:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-02 21:14:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 21:14:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 21:14:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 21:14:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 21:14:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-11-02 21:14:04,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:04,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336199589] [2022-11-02 21:14:04,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336199589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:04,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:04,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:14:04,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066314793] [2022-11-02 21:14:04,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:04,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:14:04,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:04,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:14:04,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:14:04,539 INFO L87 Difference]: Start difference. First operand 18937 states and 27486 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:14:07,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:22,334 INFO L93 Difference]: Finished difference Result 24653 states and 36002 transitions. [2022-11-02 21:14:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:14:22,334 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 174 [2022-11-02 21:14:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:22,439 INFO L225 Difference]: With dead ends: 24653 [2022-11-02 21:14:22,439 INFO L226 Difference]: Without dead ends: 24651 [2022-11-02 21:14:22,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:14:22,451 INFO L413 NwaCegarLoop]: 2960 mSDtfsCounter, 2030 mSDsluCounter, 3284 mSDsCounter, 0 mSdLazyCounter, 7173 mSolverCounterSat, 1614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2495 SdHoareTripleChecker+Valid, 6244 SdHoareTripleChecker+Invalid, 8787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1614 IncrementalHoareTripleChecker+Valid, 7173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:22,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2495 Valid, 6244 Invalid, 8787 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1614 Valid, 7173 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2022-11-02 21:14:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24651 states. [2022-11-02 21:14:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24651 to 24535. [2022-11-02 21:14:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24535 states, 14334 states have (on average 1.2494767685223942) internal successors, (17910), 14668 states have internal predecessors, (17910), 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-11-02 21:14:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24535 states to 24535 states and 35795 transitions. [2022-11-02 21:14:25,164 INFO L78 Accepts]: Start accepts. Automaton has 24535 states and 35795 transitions. Word has length 174 [2022-11-02 21:14:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:25,165 INFO L495 AbstractCegarLoop]: Abstraction has 24535 states and 35795 transitions. [2022-11-02 21:14:25,165 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, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:14:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 24535 states and 35795 transitions. [2022-11-02 21:14:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-02 21:14:25,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:25,168 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 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] [2022-11-02 21:14:25,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:14:25,168 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-11-02 21:14:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 365244088, now seen corresponding path program 1 times [2022-11-02 21:14:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871018911] [2022-11-02 21:14:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:14:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:14:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:14:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:14:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:14:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:14:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:14:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:14:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:14:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:14:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:14:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:14:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:14:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 21:14:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:14:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 21:14:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 21:14:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 21:14:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 21:14:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-02 21:14:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 21:14:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-02 21:14:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 21:14:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-02 21:14:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 21:14:25,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:25,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871018911] [2022-11-02 21:14:25,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871018911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:25,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:25,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:14:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626005640] [2022-11-02 21:14:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:25,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:14:25,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:14:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:14:25,741 INFO L87 Difference]: Start difference. First operand 24535 states and 35795 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, (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-11-02 21:14:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:36,301 INFO L93 Difference]: Finished difference Result 24657 states and 36005 transitions. [2022-11-02 21:14:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:14:36,302 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, (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 199 [2022-11-02 21:14:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:36,402 INFO L225 Difference]: With dead ends: 24657 [2022-11-02 21:14:36,402 INFO L226 Difference]: Without dead ends: 24655 [2022-11-02 21:14:36,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:14:36,415 INFO L413 NwaCegarLoop]: 2392 mSDtfsCounter, 2460 mSDsluCounter, 2879 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2713 SdHoareTripleChecker+Valid, 5271 SdHoareTripleChecker+Invalid, 5813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1744 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:36,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2713 Valid, 5271 Invalid, 5813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1744 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-02 21:14:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24655 states. [2022-11-02 21:14:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24655 to 24539. [2022-11-02 21:14:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24539 states, 14337 states have (on average 1.2494245658087466) internal successors, (17913), 14671 states have internal predecessors, (17913), 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-11-02 21:14:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24539 states to 24539 states and 35798 transitions. [2022-11-02 21:14:39,176 INFO L78 Accepts]: Start accepts. Automaton has 24539 states and 35798 transitions. Word has length 199 [2022-11-02 21:14:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:39,176 INFO L495 AbstractCegarLoop]: Abstraction has 24539 states and 35798 transitions. [2022-11-02 21:14:39,176 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, (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-11-02 21:14:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 24539 states and 35798 transitions. [2022-11-02 21:14:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-02 21:14:39,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:39,179 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 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] [2022-11-02 21:14:39,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:14:39,179 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-11-02 21:14:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1287441911, now seen corresponding path program 1 times [2022-11-02 21:14:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:39,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843361035] [2022-11-02 21:14:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:14:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:14:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:14:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 21:14:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:14:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 21:14:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:14:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:14:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:14:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 21:14:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:14:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:14:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:14:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 21:14:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:14:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 21:14:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-02 21:14:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-02 21:14:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat