./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/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-wan-farsync.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/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 3dcd453e519a411dcaaa8ea095e5544a2fd8cdb9a31e662fc6de670ff7f7c541 --- 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 20:08:17,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:08:17,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:08:17,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:08:17,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:08:17,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:08:17,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:08:17,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:08:17,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:08:17,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:08:17,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:08:17,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:08:17,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:08:17,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:08:17,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:08:17,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:08:17,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:08:17,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:08:17,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:08:17,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:08:17,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:08:17,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:08:17,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:08:17,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:08:17,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:08:17,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:08:17,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:08:17,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:08:17,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:08:17,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:08:17,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:08:17,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:08:17,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:08:17,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:08:17,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:08:17,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:08:17,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:08:17,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:08:17,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:08:17,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:08:17,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:08:17,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:08:17,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:08:17,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:08:17,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:08:17,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:08:17,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:08:17,768 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:08:17,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:08:17,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:08:17,770 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:08:17,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:08:17,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:08:17,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:08:17,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:08:17,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:08:17,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:08:17,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:08:17,773 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:08:17,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:08:17,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:08:17,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:08:17,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:08:17,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:08:17,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:08:17,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:08:17,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:08:17,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:08:17,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:08:17,787 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:08:17,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:08:17,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:08:17,788 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/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 -> 3dcd453e519a411dcaaa8ea095e5544a2fd8cdb9a31e662fc6de670ff7f7c541 [2022-11-02 20:08:18,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:08:18,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:08:18,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:08:18,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:08:18,241 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:08:18,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-11-02 20:08:18,338 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/data/b21bf31e4/e4b4afebbf814b6196703737b83ff707/FLAG8b2ec5227 [2022-11-02 20:08:19,531 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:08:19,531 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-11-02 20:08:19,575 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/data/b21bf31e4/e4b4afebbf814b6196703737b83ff707/FLAG8b2ec5227 [2022-11-02 20:08:19,817 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/data/b21bf31e4/e4b4afebbf814b6196703737b83ff707 [2022-11-02 20:08:19,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:08:19,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:08:19,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:08:19,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:08:19,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:08:19,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:08:19" (1/1) ... [2022-11-02 20:08:19,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ba121f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:19, skipping insertion in model container [2022-11-02 20:08:19,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:08:19" (1/1) ... [2022-11-02 20:08:19,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:08:20,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:08:23,369 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[320934,320947] [2022-11-02 20:08:23,372 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321103,321116] [2022-11-02 20:08:23,373 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321270,321283] [2022-11-02 20:08:23,374 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321438,321451] [2022-11-02 20:08:23,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:08:23,446 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:08:24,048 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[320934,320947] [2022-11-02 20:08:24,049 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321103,321116] [2022-11-02 20:08:24,050 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321270,321283] [2022-11-02 20:08:24,050 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_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321438,321451] [2022-11-02 20:08:24,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:08:24,305 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:08:24,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24 WrapperNode [2022-11-02 20:08:24,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:08:24,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:08:24,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:08:24,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:08:24,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:24,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:24,726 INFO L138 Inliner]: procedures = 418, calls = 1969, calls flagged for inlining = 195, calls inlined = 179, statements flattened = 5220 [2022-11-02 20:08:24,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:08:24,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:08:24,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:08:24,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:08:24,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:24,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:24,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:24,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:24,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:25,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:25,071 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:25,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:25,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:08:25,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:08:25,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:08:25,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:08:25,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (1/1) ... [2022-11-02 20:08:25,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:08:25,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:08:25,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:08:25,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:08:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-11-02 20:08:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-11-02 20:08:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-11-02 20:08:25,358 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-11-02 20:08:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:08:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:08:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-11-02 20:08:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-11-02 20:08:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:08:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:08:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure fst_remove_one [2022-11-02 20:08:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_remove_one [2022-11-02 20:08:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-11-02 20:08:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-11-02 20:08:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 20:08:25,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 20:08:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-11-02 20:08:25,361 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-11-02 20:08:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-11-02 20:08:25,361 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-11-02 20:08:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-11-02 20:08:25,361 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-11-02 20:08:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_61 [2022-11-02 20:08:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_61 [2022-11-02 20:08:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_67 [2022-11-02 20:08:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_67 [2022-11-02 20:08:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 20:08:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 20:08:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure fst_close [2022-11-02 20:08:25,363 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_close [2022-11-02 20:08:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-02 20:08:25,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-02 20:08:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-11-02 20:08:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-11-02 20:08:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-02 20:08:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-02 20:08:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure fst_tx_timeout [2022-11-02 20:08:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_tx_timeout [2022-11-02 20:08:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-02 20:08:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-02 20:08:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:08:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-11-02 20:08:25,366 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-11-02 20:08:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure fst_open [2022-11-02 20:08:25,366 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_open [2022-11-02 20:08:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_type_trans [2022-11-02 20:08:25,366 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_type_trans [2022-11-02 20:08:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-02 20:08:25,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-02 20:08:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:08:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-11-02 20:08:25,369 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-11-02 20:08:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-11-02 20:08:25,370 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-11-02 20:08:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-02 20:08:25,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-02 20:08:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:08:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-02 20:08:25,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-02 20:08:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:08:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-11-02 20:08:25,372 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-11-02 20:08:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:08:25,372 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:08:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure fst_issue_cmd [2022-11-02 20:08:25,373 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_issue_cmd [2022-11-02 20:08:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-11-02 20:08:25,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-11-02 20:08:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-11-02 20:08:25,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-11-02 20:08:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-11-02 20:08:25,374 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-11-02 20:08:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-11-02 20:08:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-11-02 20:08:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-11-02 20:08:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-11-02 20:08:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-11-02 20:08:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-11-02 20:08:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:08:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-11-02 20:08:25,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-11-02 20:08:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_2 [2022-11-02 20:08:25,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_2 [2022-11-02 20:08:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-11-02 20:08:25,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-11-02 20:08:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:08:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure fst_cpureset [2022-11-02 20:08:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_cpureset [2022-11-02 20:08:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:08:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:08:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:08:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:08:25,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:08:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-11-02 20:08:25,380 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-11-02 20:08:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:08:25,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:08:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-11-02 20:08:25,381 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-11-02 20:08:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure fst_q_work_item [2022-11-02 20:08:25,381 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_q_work_item [2022-11-02 20:08:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-11-02 20:08:25,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-11-02 20:08:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 20:08:25,382 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 20:08:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-02 20:08:25,382 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-02 20:08:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-11-02 20:08:25,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-11-02 20:08:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-11-02 20:08:25,383 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-11-02 20:08:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-11-02 20:08:25,385 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-11-02 20:08:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-11-02 20:08:25,388 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-11-02 20:08:25,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:08:25,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:08:25,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:08:25,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:08:25,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:08:25,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:08:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 20:08:25,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 20:08:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-11-02 20:08:25,397 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-11-02 20:08:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:08:25,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:08:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-02 20:08:25,397 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-02 20:08:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2022-11-02 20:08:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2022-11-02 20:08:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-02 20:08:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-02 20:08:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:08:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure module_put [2022-11-02 20:08:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure module_put [2022-11-02 20:08:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:08:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-11-02 20:08:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-11-02 20:08:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:08:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-02 20:08:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-02 20:08:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-11-02 20:08:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-11-02 20:08:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-11-02 20:08:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-11-02 20:08:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-11-02 20:08:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-11-02 20:08:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-02 20:08:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-02 20:08:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-11-02 20:08:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-11-02 20:08:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-11-02 20:08:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-11-02 20:08:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure farsync_type_trans [2022-11-02 20:08:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure farsync_type_trans [2022-11-02 20:08:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 20:08:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 20:08:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-02 20:08:25,402 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-02 20:08:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_fst_work_q_lock [2022-11-02 20:08:25,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_fst_work_q_lock [2022-11-02 20:08:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:08:25,402 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:08:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:08:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure fst_disable_intr [2022-11-02 20:08:25,403 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_disable_intr [2022-11-02 20:08:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:08:25,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:08:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-02 20:08:25,403 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-02 20:08:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-11-02 20:08:25,404 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-11-02 20:08:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure do_bottom_half_tx [2022-11-02 20:08:25,404 INFO L138 BoogieDeclarations]: Found implementation of procedure do_bottom_half_tx [2022-11-02 20:08:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure fst_process_rx_status [2022-11-02 20:08:25,404 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_process_rx_status [2022-11-02 20:08:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-02 20:08:25,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-02 20:08:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-11-02 20:08:25,405 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-11-02 20:08:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_ioctl [2022-11-02 20:08:25,405 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_ioctl [2022-11-02 20:08:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-11-02 20:08:25,405 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-11-02 20:08:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-11-02 20:08:25,406 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-11-02 20:08:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-11-02 20:08:25,406 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-11-02 20:08:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure fst_clear_intr [2022-11-02 20:08:25,407 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_clear_intr [2022-11-02 20:08:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:08:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-11-02 20:08:25,408 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-11-02 20:08:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-11-02 20:08:25,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-11-02 20:08:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-11-02 20:08:25,408 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-11-02 20:08:26,571 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:08:26,581 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:08:26,726 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:08:31,345 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-11-02 20:08:31,607 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:08:31,656 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:08:31,656 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:08:31,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:08:31 BoogieIcfgContainer [2022-11-02 20:08:31,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:08:31,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:08:31,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:08:31,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:08:31,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:08:19" (1/3) ... [2022-11-02 20:08:31,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761ba24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:08:31, skipping insertion in model container [2022-11-02 20:08:31,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:08:24" (2/3) ... [2022-11-02 20:08:31,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761ba24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:08:31, skipping insertion in model container [2022-11-02 20:08:31,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:08:31" (3/3) ... [2022-11-02 20:08:31,684 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-11-02 20:08:31,707 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:08:31,707 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-02 20:08:31,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:08:31,888 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;@cf72fcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:08:31,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-02 20:08:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 1831 states, 1250 states have (on average 1.2888) internal successors, (1611), 1264 states have internal predecessors, (1611), 488 states have call successors, (488), 91 states have call predecessors, (488), 90 states have return successors, (481), 479 states have call predecessors, (481), 481 states have call successors, (481) [2022-11-02 20:08:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:08:31,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:31,939 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 20:08:31,940 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 20:08:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1894555344, now seen corresponding path program 1 times [2022-11-02 20:08:31,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:31,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945632511] [2022-11-02 20:08:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:31,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:08:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:08:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,923 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 20:08:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:32,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945632511] [2022-11-02 20:08:32,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945632511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:32,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:32,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:08:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792564013] [2022-11-02 20:08:32,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:32,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:08:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:32,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:08:32,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:08:32,990 INFO L87 Difference]: Start difference. First operand has 1831 states, 1250 states have (on average 1.2888) internal successors, (1611), 1264 states have internal predecessors, (1611), 488 states have call successors, (488), 91 states have call predecessors, (488), 90 states have return successors, (481), 479 states have call predecessors, (481), 481 states have call successors, (481) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:08:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:40,682 INFO L93 Difference]: Finished difference Result 5375 states and 7700 transitions. [2022-11-02 20:08:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:08:40,686 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 20:08:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:40,734 INFO L225 Difference]: With dead ends: 5375 [2022-11-02 20:08:40,734 INFO L226 Difference]: Without dead ends: 3548 [2022-11-02 20:08:40,750 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 20:08:40,754 INFO L413 NwaCegarLoop]: 2739 mSDtfsCounter, 2906 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 1338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3348 SdHoareTripleChecker+Valid, 5201 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1338 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:40,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3348 Valid, 5201 Invalid, 3437 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1338 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-02 20:08:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2022-11-02 20:08:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3526. [2022-11-02 20:08:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 2425 states have (on average 1.285360824742268) internal successors, (3117), 2452 states have internal predecessors, (3117), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) [2022-11-02 20:08:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4957 transitions. [2022-11-02 20:08:41,277 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4957 transitions. Word has length 83 [2022-11-02 20:08:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:41,278 INFO L495 AbstractCegarLoop]: Abstraction has 3526 states and 4957 transitions. [2022-11-02 20:08:41,279 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 20:08:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4957 transitions. [2022-11-02 20:08:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 20:08:41,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:41,294 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:41,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:08:41,295 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 20:08:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1557885216, now seen corresponding path program 1 times [2022-11-02 20:08:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:41,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906211935] [2022-11-02 20:08:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:08:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:08:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:41,682 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 20:08:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:41,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906211935] [2022-11-02 20:08:41,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906211935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:41,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:41,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:08:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589458577] [2022-11-02 20:08:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:41,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:08:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:41,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:08:41,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:08:41,687 INFO L87 Difference]: Start difference. First operand 3526 states and 4957 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:08:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:48,157 INFO L93 Difference]: Finished difference Result 9738 states and 13652 transitions. [2022-11-02 20:08:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:08:48,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2022-11-02 20:08:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:48,203 INFO L225 Difference]: With dead ends: 9738 [2022-11-02 20:08:48,203 INFO L226 Difference]: Without dead ends: 6227 [2022-11-02 20:08:48,218 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 20:08:48,220 INFO L413 NwaCegarLoop]: 2637 mSDtfsCounter, 2403 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 1263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 5107 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1263 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:48,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 5107 Invalid, 3281 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1263 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-02 20:08:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2022-11-02 20:08:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 6161. [2022-11-02 20:08:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6161 states, 4222 states have (on average 1.2806726669824728) internal successors, (5407), 4274 states have internal predecessors, (5407), 1599 states have call successors, (1599), 338 states have call predecessors, (1599), 337 states have return successors, (1601), 1580 states have call predecessors, (1601), 1595 states have call successors, (1601) [2022-11-02 20:08:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 8607 transitions. [2022-11-02 20:08:48,691 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 8607 transitions. Word has length 95 [2022-11-02 20:08:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:48,694 INFO L495 AbstractCegarLoop]: Abstraction has 6161 states and 8607 transitions. [2022-11-02 20:08:48,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:08:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 8607 transitions. [2022-11-02 20:08:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 20:08:48,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:48,700 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:48,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:08:48,700 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 20:08:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash 464683726, now seen corresponding path program 1 times [2022-11-02 20:08:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:48,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78793455] [2022-11-02 20:08:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:48,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:08:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:08:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:49,112 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 20:08:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:49,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78793455] [2022-11-02 20:08:49,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78793455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:49,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:49,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:08:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160561633] [2022-11-02 20:08:49,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:49,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:08:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:49,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:08:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:08:49,122 INFO L87 Difference]: Start difference. First operand 6161 states and 8607 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:08:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:54,679 INFO L93 Difference]: Finished difference Result 11987 states and 16767 transitions. [2022-11-02 20:08:54,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:08:54,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-11-02 20:08:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:54,721 INFO L225 Difference]: With dead ends: 11987 [2022-11-02 20:08:54,721 INFO L226 Difference]: Without dead ends: 5841 [2022-11-02 20:08:54,745 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 20:08:54,747 INFO L413 NwaCegarLoop]: 3000 mSDtfsCounter, 2083 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 1002 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2449 SdHoareTripleChecker+Valid, 5602 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1002 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:54,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2449 Valid, 5602 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1002 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 20:08:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5841 states. [2022-11-02 20:08:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5841 to 5789. [2022-11-02 20:08:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 4010 states have (on average 1.2892768079800498) internal successors, (5170), 4058 states have internal predecessors, (5170), 1442 states have call successors, (1442), 337 states have call predecessors, (1442), 334 states have return successors, (1441), 1419 states have call predecessors, (1441), 1438 states have call successors, (1441) [2022-11-02 20:08:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 8053 transitions. [2022-11-02 20:08:55,094 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 8053 transitions. Word has length 93 [2022-11-02 20:08:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:55,097 INFO L495 AbstractCegarLoop]: Abstraction has 5789 states and 8053 transitions. [2022-11-02 20:08:55,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:08:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 8053 transitions. [2022-11-02 20:08:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:08:55,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:55,102 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:55,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:08:55,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:08:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:55,103 INFO L85 PathProgramCache]: Analyzing trace with hash 959535160, now seen corresponding path program 1 times [2022-11-02 20:08:55,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:55,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494745442] [2022-11-02 20:08:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:08:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,551 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 20:08:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:55,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494745442] [2022-11-02 20:08:55,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494745442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:55,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:55,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:08:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124482516] [2022-11-02 20:08:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:55,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:08:55,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:55,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:08:55,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:08:55,555 INFO L87 Difference]: Start difference. First operand 5789 states and 8053 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:09:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:02,292 INFO L93 Difference]: Finished difference Result 16029 states and 22227 transitions. [2022-11-02 20:09:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:09:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-11-02 20:09:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:02,355 INFO L225 Difference]: With dead ends: 16029 [2022-11-02 20:09:02,356 INFO L226 Difference]: Without dead ends: 10255 [2022-11-02 20:09:02,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:09:02,379 INFO L413 NwaCegarLoop]: 2688 mSDtfsCounter, 2756 mSDsluCounter, 2444 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 1368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3166 SdHoareTripleChecker+Valid, 5132 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1368 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:02,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3166 Valid, 5132 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1368 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-02 20:09:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2022-11-02 20:09:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 10179. [2022-11-02 20:09:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10179 states, 7048 states have (on average 1.2775255391600453) internal successors, (9004), 7143 states have internal predecessors, (9004), 2508 states have call successors, (2508), 625 states have call predecessors, (2508), 620 states have return successors, (2510), 2455 states have call predecessors, (2510), 2504 states have call successors, (2510) [2022-11-02 20:09:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 14022 transitions. [2022-11-02 20:09:02,976 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 14022 transitions. Word has length 91 [2022-11-02 20:09:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:02,977 INFO L495 AbstractCegarLoop]: Abstraction has 10179 states and 14022 transitions. [2022-11-02 20:09:02,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:09:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 14022 transitions. [2022-11-02 20:09:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:09:02,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:02,986 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:02,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:09:02,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:09:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash 554901829, now seen corresponding path program 1 times [2022-11-02 20:09:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:02,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75228478] [2022-11-02 20:09:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:09:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:03,337 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 20:09:03,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:03,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75228478] [2022-11-02 20:09:03,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75228478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:03,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:03,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:09:03,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296638335] [2022-11-02 20:09:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:03,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:03,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:03,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:03,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:03,341 INFO L87 Difference]: Start difference. First operand 10179 states and 14022 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:09:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:09,873 INFO L93 Difference]: Finished difference Result 29249 states and 40262 transitions. [2022-11-02 20:09:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:09:09,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2022-11-02 20:09:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:09,985 INFO L225 Difference]: With dead ends: 29249 [2022-11-02 20:09:09,985 INFO L226 Difference]: Without dead ends: 19085 [2022-11-02 20:09:10,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:09:10,027 INFO L413 NwaCegarLoop]: 2979 mSDtfsCounter, 2797 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 1327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3231 SdHoareTripleChecker+Valid, 5557 SdHoareTripleChecker+Invalid, 3471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1327 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:10,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3231 Valid, 5557 Invalid, 3471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1327 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-02 20:09:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19085 states. [2022-11-02 20:09:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19085 to 18959. [2022-11-02 20:09:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18959 states, 13152 states have (on average 1.2693886861313868) internal successors, (16695), 13342 states have internal predecessors, (16695), 4633 states have call successors, (4633), 1180 states have call predecessors, (4633), 1171 states have return successors, (4641), 4520 states have call predecessors, (4641), 4629 states have call successors, (4641) [2022-11-02 20:09:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18959 states to 18959 states and 25969 transitions. [2022-11-02 20:09:11,340 INFO L78 Accepts]: Start accepts. Automaton has 18959 states and 25969 transitions. Word has length 92 [2022-11-02 20:09:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:11,342 INFO L495 AbstractCegarLoop]: Abstraction has 18959 states and 25969 transitions. [2022-11-02 20:09:11,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:09:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 18959 states and 25969 transitions. [2022-11-02 20:09:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:09:11,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:11,345 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:11,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:09:11,346 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:09:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1895911466, now seen corresponding path program 1 times [2022-11-02 20:09:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:11,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86928052] [2022-11-02 20:09:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:09:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:09:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:09:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:09:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:09:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-02 20:09:11,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:11,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86928052] [2022-11-02 20:09:11,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86928052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:11,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:11,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:09:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850240807] [2022-11-02 20:09:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:11,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:11,813 INFO L87 Difference]: Start difference. First operand 18959 states and 25969 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:09:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:18,515 INFO L93 Difference]: Finished difference Result 53075 states and 72634 transitions. [2022-11-02 20:09:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:09:18,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2022-11-02 20:09:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:18,695 INFO L225 Difference]: With dead ends: 53075 [2022-11-02 20:09:18,696 INFO L226 Difference]: Without dead ends: 34131 [2022-11-02 20:09:18,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:09:18,760 INFO L413 NwaCegarLoop]: 3292 mSDtfsCounter, 2645 mSDsluCounter, 2838 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 1219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 6130 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1219 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:18,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 6130 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1219 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 20:09:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34131 states. [2022-11-02 20:09:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34131 to 33921. [2022-11-02 20:09:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33921 states, 23505 states have (on average 1.2630929589449054) internal successors, (29689), 23899 states have internal predecessors, (29689), 8304 states have call successors, (8304), 2142 states have call predecessors, (8304), 2109 states have return successors, (8332), 8039 states have call predecessors, (8332), 8300 states have call successors, (8332) [2022-11-02 20:09:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33921 states to 33921 states and 46325 transitions. [2022-11-02 20:09:21,338 INFO L78 Accepts]: Start accepts. Automaton has 33921 states and 46325 transitions. Word has length 108 [2022-11-02 20:09:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:21,339 INFO L495 AbstractCegarLoop]: Abstraction has 33921 states and 46325 transitions. [2022-11-02 20:09:21,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:09:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33921 states and 46325 transitions. [2022-11-02 20:09:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-02 20:09:21,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:21,343 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:21,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:09:21,344 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 20:09:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:21,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1275541526, now seen corresponding path program 1 times [2022-11-02 20:09:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:21,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11656139] [2022-11-02 20:09:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:09:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:09:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:09:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:09:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:09:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:09:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:09:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:09:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:09:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 20:09:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-11-02 20:09:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11656139] [2022-11-02 20:09:21,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11656139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:21,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:21,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:09:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103310808] [2022-11-02 20:09:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:21,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:21,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:21,758 INFO L87 Difference]: Start difference. First operand 33921 states and 46325 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:09:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:27,153 INFO L93 Difference]: Finished difference Result 67982 states and 92884 transitions. [2022-11-02 20:09:27,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:09:27,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2022-11-02 20:09:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:27,339 INFO L225 Difference]: With dead ends: 67982 [2022-11-02 20:09:27,340 INFO L226 Difference]: Without dead ends: 34153 [2022-11-02 20:09:27,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:27,581 INFO L413 NwaCegarLoop]: 2397 mSDtfsCounter, 516 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 4880 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:27,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 4880 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-02 20:09:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34153 states. [2022-11-02 20:09:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34153 to 33953. [2022-11-02 20:09:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33953 states, 23537 states have (on average 1.26273526787611) internal successors, (29721), 23931 states have internal predecessors, (29721), 8304 states have call successors, (8304), 2142 states have call predecessors, (8304), 2109 states have return successors, (8332), 8039 states have call predecessors, (8332), 8300 states have call successors, (8332) [2022-11-02 20:09:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33953 states to 33953 states and 46357 transitions. [2022-11-02 20:09:30,205 INFO L78 Accepts]: Start accepts. Automaton has 33953 states and 46357 transitions. Word has length 150 [2022-11-02 20:09:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:30,206 INFO L495 AbstractCegarLoop]: Abstraction has 33953 states and 46357 transitions. [2022-11-02 20:09:30,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:09:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 33953 states and 46357 transitions. [2022-11-02 20:09:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-02 20:09:30,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:30,210 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:30,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:09:30,211 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 20:09:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1623084178, now seen corresponding path program 1 times [2022-11-02 20:09:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:30,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777808170] [2022-11-02 20:09:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:30,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:09:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:09:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:09:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:09:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:09:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:09:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:09:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:09:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:09:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:09:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-11-02 20:09:30,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777808170] [2022-11-02 20:09:30,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777808170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198089182] [2022-11-02 20:09:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:30,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:30,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:30,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:30,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:09:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:09:31,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-11-02 20:09:32,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:09:32,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198089182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:32,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:09:32,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-02 20:09:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221735391] [2022-11-02 20:09:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:09:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:09:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:32,046 INFO L87 Difference]: Start difference. First operand 33953 states and 46357 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:09:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:34,007 INFO L93 Difference]: Finished difference Result 73226 states and 100073 transitions. [2022-11-02 20:09:34,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:09:34,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2022-11-02 20:09:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:34,199 INFO L225 Difference]: With dead ends: 73226 [2022-11-02 20:09:34,199 INFO L226 Difference]: Without dead ends: 39365 [2022-11-02 20:09:34,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:34,299 INFO L413 NwaCegarLoop]: 3026 mSDtfsCounter, 2485 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2485 SdHoareTripleChecker+Valid, 5102 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:34,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2485 Valid, 5102 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39365 states. [2022-11-02 20:09:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39365 to 39342. [2022-11-02 20:09:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39342 states, 27375 states have (on average 1.2628675799086757) internal successors, (34571), 27781 states have internal predecessors, (34571), 9558 states have call successors, (9558), 2443 states have call predecessors, (9558), 2406 states have return successors, (9594), 9307 states have call predecessors, (9594), 9554 states have call successors, (9594) [2022-11-02 20:09:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39342 states to 39342 states and 53723 transitions. [2022-11-02 20:09:36,858 INFO L78 Accepts]: Start accepts. Automaton has 39342 states and 53723 transitions. Word has length 152 [2022-11-02 20:09:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:36,859 INFO L495 AbstractCegarLoop]: Abstraction has 39342 states and 53723 transitions. [2022-11-02 20:09:36,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:09:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 39342 states and 53723 transitions. [2022-11-02 20:09:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-02 20:09:36,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:36,864 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:36,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:37,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:37,091 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 20:09:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1763632788, now seen corresponding path program 1 times [2022-11-02 20:09:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:37,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923754437] [2022-11-02 20:09:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:09:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:09:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:09:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:09:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:09:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:09:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:09:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:09:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:09:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:09:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-11-02 20:09:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923754437] [2022-11-02 20:09:37,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923754437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412172096] [2022-11-02 20:09:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:37,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:37,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:37,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:37,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:09:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:38,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:09:38,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-02 20:09:38,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-11-02 20:09:38,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412172096] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:38,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:38,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-11-02 20:09:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532637746] [2022-11-02 20:09:38,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:38,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:09:38,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:38,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:09:38,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:09:38,671 INFO L87 Difference]: Start difference. First operand 39342 states and 53723 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 20:09:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:47,516 INFO L93 Difference]: Finished difference Result 78848 states and 107706 transitions. [2022-11-02 20:09:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:47,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 152 [2022-11-02 20:09:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:47,887 INFO L225 Difference]: With dead ends: 78848 [2022-11-02 20:09:47,888 INFO L226 Difference]: Without dead ends: 39598 [2022-11-02 20:09:48,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:09:48,002 INFO L413 NwaCegarLoop]: 2397 mSDtfsCounter, 519 mSDsluCounter, 8271 mSDsCounter, 0 mSdLazyCounter, 6049 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 10668 SdHoareTripleChecker+Invalid, 6530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 6049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:48,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 10668 Invalid, 6530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 6049 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-02 20:09:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39598 states. [2022-11-02 20:09:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39598 to 39390. [2022-11-02 20:09:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39390 states, 27423 states have (on average 1.2624074681836415) internal successors, (34619), 27829 states have internal predecessors, (34619), 9558 states have call successors, (9558), 2443 states have call predecessors, (9558), 2406 states have return successors, (9594), 9307 states have call predecessors, (9594), 9554 states have call successors, (9594) [2022-11-02 20:09:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39390 states to 39390 states and 53771 transitions. [2022-11-02 20:09:50,316 INFO L78 Accepts]: Start accepts. Automaton has 39390 states and 53771 transitions. Word has length 152 [2022-11-02 20:09:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:50,317 INFO L495 AbstractCegarLoop]: Abstraction has 39390 states and 53771 transitions. [2022-11-02 20:09:50,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 20:09:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 39390 states and 53771 transitions. [2022-11-02 20:09:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-02 20:09:50,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:50,321 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:50,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:50,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71b9cc0-79ea-4b92-9d97-1f6a4c4a31ba/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:09:50,547 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 20:09:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash 970983944, now seen corresponding path program 2 times [2022-11-02 20:09:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:50,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348140018] [2022-11-02 20:09:50,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:09:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:09:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:09:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:09:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:09:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:09:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:09:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:09:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:09:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:09:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-11-02 20:09:51,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:51,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348140018] [2022-11-02 20:09:51,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348140018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:51,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:51,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:09:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658256971] [2022-11-02 20:09:51,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:51,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:51,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:51,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:51,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:51,540 INFO L87 Difference]: Start difference. First operand 39390 states and 53771 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:09:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:57,976 INFO L93 Difference]: Finished difference Result 39604 states and 54067 transitions. [2022-11-02 20:09:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:57,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 158 [2022-11-02 20:09:57,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:58,130 INFO L225 Difference]: With dead ends: 39604 [2022-11-02 20:09:58,130 INFO L226 Difference]: Without dead ends: 39602 [2022-11-02 20:09:58,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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 20:09:58,154 INFO L413 NwaCegarLoop]: 2396 mSDtfsCounter, 2439 mSDsluCounter, 3940 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2738 SdHoareTripleChecker+Valid, 6336 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 921 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:58,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2738 Valid, 6336 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [921 Valid, 2731 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-02 20:09:58,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39602 states. [2022-11-02 20:10:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39602 to 39394. [2022-11-02 20:10:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39394 states, 27426 states have (on average 1.262378764675855) internal successors, (34622), 27832 states have internal predecessors, (34622), 9558 states have call successors, (9558), 2444 states have call predecessors, (9558), 2407 states have return successors, (9594), 9307 states have call predecessors, (9594), 9554 states have call successors, (9594) [2022-11-02 20:10:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39394 states to 39394 states and 53774 transitions. [2022-11-02 20:10:00,500 INFO L78 Accepts]: Start accepts. Automaton has 39394 states and 53774 transitions. Word has length 158 [2022-11-02 20:10:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:00,524 INFO L495 AbstractCegarLoop]: Abstraction has 39394 states and 53774 transitions. [2022-11-02 20:10:00,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:10:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 39394 states and 53774 transitions. [2022-11-02 20:10:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-02 20:10:00,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:00,529 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:00,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:10:00,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:10:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash -831660878, now seen corresponding path program 1 times [2022-11-02 20:10:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:00,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994689261] [2022-11-02 20:10:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:10:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:10:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:10:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:10:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:10:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:10:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:10:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:10:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:10:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:10:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:10:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:10:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:10:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:10:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:10:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:10:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-11-02 20:10:01,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:01,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994689261] [2022-11-02 20:10:01,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994689261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:01,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:01,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:10:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153048118] [2022-11-02 20:10:01,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:01,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:10:01,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:01,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:10:01,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:10:01,390 INFO L87 Difference]: Start difference. First operand 39394 states and 53774 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:10:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:08,044 INFO L93 Difference]: Finished difference Result 39608 states and 54070 transitions. [2022-11-02 20:10:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:10:08,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2022-11-02 20:10:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:08,156 INFO L225 Difference]: With dead ends: 39608 [2022-11-02 20:10:08,156 INFO L226 Difference]: Without dead ends: 39606 [2022-11-02 20:10:08,169 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 20:10:08,170 INFO L413 NwaCegarLoop]: 2399 mSDtfsCounter, 2431 mSDsluCounter, 3940 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2730 SdHoareTripleChecker+Valid, 6339 SdHoareTripleChecker+Invalid, 3651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:08,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2730 Valid, 6339 Invalid, 3651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2731 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-02 20:10:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39606 states. [2022-11-02 20:10:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39606 to 39398. [2022-11-02 20:10:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39398 states, 27429 states have (on average 1.2623500674468628) internal successors, (34625), 27835 states have internal predecessors, (34625), 9558 states have call successors, (9558), 2445 states have call predecessors, (9558), 2408 states have return successors, (9594), 9307 states have call predecessors, (9594), 9554 states have call successors, (9594) [2022-11-02 20:10:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39398 states to 39398 states and 53777 transitions. [2022-11-02 20:10:10,326 INFO L78 Accepts]: Start accepts. Automaton has 39398 states and 53777 transitions. Word has length 163 [2022-11-02 20:10:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:10,327 INFO L495 AbstractCegarLoop]: Abstraction has 39398 states and 53777 transitions. [2022-11-02 20:10:10,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:10:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 39398 states and 53777 transitions. [2022-11-02 20:10:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-02 20:10:10,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:10,333 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:10,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:10:10,333 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 20:10:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2048377848, now seen corresponding path program 1 times [2022-11-02 20:10:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:10,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511821529] [2022-11-02 20:10:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:10:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:10:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:10:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:10:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:10:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:10:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:10:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:10:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:10:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:10:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:10:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:10:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:10:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:10:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:10:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:10,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:10:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:11,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:10:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-11-02 20:10:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:11,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511821529] [2022-11-02 20:10:11,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511821529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:11,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:11,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:10:11,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018358090] [2022-11-02 20:10:11,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:11,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:10:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:11,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:10:11,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:10:11,018 INFO L87 Difference]: Start difference. First operand 39398 states and 53777 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:10:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:18,268 INFO L93 Difference]: Finished difference Result 39612 states and 54073 transitions. [2022-11-02 20:10:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:10:18,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2022-11-02 20:10:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:18,387 INFO L225 Difference]: With dead ends: 39612 [2022-11-02 20:10:18,387 INFO L226 Difference]: Without dead ends: 39610 [2022-11-02 20:10:18,403 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 20:10:18,404 INFO L413 NwaCegarLoop]: 2399 mSDtfsCounter, 2431 mSDsluCounter, 3940 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 919 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2730 SdHoareTripleChecker+Valid, 6339 SdHoareTripleChecker+Invalid, 3650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 919 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:18,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2730 Valid, 6339 Invalid, 3650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [919 Valid, 2731 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 20:10:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39610 states. [2022-11-02 20:10:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39610 to 39402. [2022-11-02 20:10:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39402 states, 27432 states have (on average 1.2623213764946049) internal successors, (34628), 27838 states have internal predecessors, (34628), 9558 states have call successors, (9558), 2446 states have call predecessors, (9558), 2409 states have return successors, (9594), 9307 states have call predecessors, (9594), 9554 states have call successors, (9594) [2022-11-02 20:10:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39402 states to 39402 states and 53780 transitions. [2022-11-02 20:10:20,607 INFO L78 Accepts]: Start accepts. Automaton has 39402 states and 53780 transitions. Word has length 168 [2022-11-02 20:10:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:20,608 INFO L495 AbstractCegarLoop]: Abstraction has 39402 states and 53780 transitions. [2022-11-02 20:10:20,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:10:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 39402 states and 53780 transitions. [2022-11-02 20:10:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-02 20:10:20,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:20,614 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 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 20:10:20,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:10:20,615 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 20:10:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -450932881, now seen corresponding path program 1 times [2022-11-02 20:10:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:20,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459027702] [2022-11-02 20:10:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:10:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:10:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:10:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:10:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:10:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:10:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:20,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:10:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:10:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:10:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:10:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:10:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:10:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:10:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:10:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:10:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 20:10:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:10:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 20:10:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 20:10:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:10:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-11-02 20:10:21,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:21,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459027702] [2022-11-02 20:10:21,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459027702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:21,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:21,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:10:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816034906] [2022-11-02 20:10:21,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:21,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:10:21,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:21,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:10:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:10:21,257 INFO L87 Difference]: Start difference. First operand 39402 states and 53780 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:10:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:32,793 INFO L93 Difference]: Finished difference Result 78679 states and 107379 transitions. [2022-11-02 20:10:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:10:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 185 [2022-11-02 20:10:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:32,942 INFO L225 Difference]: With dead ends: 78679 [2022-11-02 20:10:32,942 INFO L226 Difference]: Without dead ends: 46359 [2022-11-02 20:10:33,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:10:33,014 INFO L413 NwaCegarLoop]: 2779 mSDtfsCounter, 3338 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 2476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3594 SdHoareTripleChecker+Valid, 6182 SdHoareTripleChecker+Invalid, 5343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2476 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:33,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3594 Valid, 6182 Invalid, 5343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2476 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-11-02 20:10:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46359 states. [2022-11-02 20:10:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46359 to 46107. [2022-11-02 20:10:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46107 states, 32154 states have (on average 1.2577595322510418) internal successors, (40442), 32608 states have internal predecessors, (40442), 11076 states have call successors, (11076), 2915 states have call predecessors, (11076), 2874 states have return successors, (11120), 10803 states have call predecessors, (11120), 11072 states have call successors, (11120) [2022-11-02 20:10:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46107 states to 46107 states and 62638 transitions. [2022-11-02 20:10:36,559 INFO L78 Accepts]: Start accepts. Automaton has 46107 states and 62638 transitions. Word has length 185 [2022-11-02 20:10:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:36,560 INFO L495 AbstractCegarLoop]: Abstraction has 46107 states and 62638 transitions. [2022-11-02 20:10:36,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:10:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 46107 states and 62638 transitions. [2022-11-02 20:10:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-02 20:10:36,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:36,566 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:36,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:10:36,567 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 20:10:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1047985428, now seen corresponding path program 1 times [2022-11-02 20:10:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:36,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977664837] [2022-11-02 20:10:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:10:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:10:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:10:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:10:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:10:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:10:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:10:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:10:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 20:10:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:10:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:10:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:10:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:10:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:10:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:10:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-02 20:10:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:10:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:10:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 20:10:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-02 20:10:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:10:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-11-02 20:10:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977664837] [2022-11-02 20:10:37,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977664837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:37,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:37,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:10:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84062475] [2022-11-02 20:10:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:37,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:10:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:10:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:10:37,190 INFO L87 Difference]: Start difference. First operand 46107 states and 62638 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-02 20:10:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:48,422 INFO L93 Difference]: Finished difference Result 92034 states and 125121 transitions. [2022-11-02 20:10:48,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:10:48,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 184 [2022-11-02 20:10:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:48,574 INFO L225 Difference]: With dead ends: 92034 [2022-11-02 20:10:48,574 INFO L226 Difference]: Without dead ends: 46019 [2022-11-02 20:10:48,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:10:48,660 INFO L413 NwaCegarLoop]: 4237 mSDtfsCounter, 2586 mSDsluCounter, 4741 mSDsCounter, 0 mSdLazyCounter, 3034 mSolverCounterSat, 1863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 8978 SdHoareTripleChecker+Invalid, 4897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1863 IncrementalHoareTripleChecker+Valid, 3034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:48,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 8978 Invalid, 4897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1863 Valid, 3034 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-11-02 20:10:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46019 states.