./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/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-ethernet-dnet.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/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 fbb6aba39a63540626ae26255eab93a5f2c0864f87ba11cb320579066e7aefd2 --- 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:07:13,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:07:13,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:07:13,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:07:13,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:07:13,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:07:13,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:07:13,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:07:13,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:07:13,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:07:13,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:07:13,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:07:13,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:07:13,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:07:13,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:07:13,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:07:13,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:07:13,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:07:13,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:07:13,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:07:13,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:07:13,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:07:13,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:07:13,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:07:13,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:07:13,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:07:13,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:07:13,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:07:13,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:07:13,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:07:13,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:07:13,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:07:13,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:07:13,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:07:13,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:07:13,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:07:13,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:07:13,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:07:13,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:07:13,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:07:13,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:07:13,316 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:07:13,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:07:13,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:07:13,339 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:07:13,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:07:13,340 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:07:13,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:07:13,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:07:13,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:07:13,342 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:07:13,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:07:13,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:07:13,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:07:13,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:07:13,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:07:13,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:07:13,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:07:13,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:07:13,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:07:13,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:07:13,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:07:13,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:07:13,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:07:13,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:07:13,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:07:13,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:07:13,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:07:13,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:07:13,347 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:07:13,347 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:07:13,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:07:13,347 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/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 -> fbb6aba39a63540626ae26255eab93a5f2c0864f87ba11cb320579066e7aefd2 [2022-11-02 20:07:13,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:07:13,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:07:13,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:07:13,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:07:13,640 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:07:13,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i [2022-11-02 20:07:13,726 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/data/d85252f2f/f6a66682544a4154a47b94d4000fd448/FLAG2c0e66cd2 [2022-11-02 20:07:14,700 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:07:14,700 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i [2022-11-02 20:07:14,747 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/data/d85252f2f/f6a66682544a4154a47b94d4000fd448/FLAG2c0e66cd2 [2022-11-02 20:07:15,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/data/d85252f2f/f6a66682544a4154a47b94d4000fd448 [2022-11-02 20:07:15,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:07:15,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:07:15,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:07:15,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:07:15,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:07:15,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:07:15" (1/1) ... [2022-11-02 20:07:15,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404b6c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:15, skipping insertion in model container [2022-11-02 20:07:15,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:07:15" (1/1) ... [2022-11-02 20:07:15,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:07:15,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:07:18,474 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i[305216,305229] [2022-11-02 20:07:18,479 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i[305385,305398] [2022-11-02 20:07:18,479 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i[305552,305565] [2022-11-02 20:07:18,480 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i[305720,305733] [2022-11-02 20:07:18,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:07:18,531 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:07:18,940 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i[305216,305229] [2022-11-02 20:07:18,941 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i[305385,305398] [2022-11-02 20:07:18,942 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i[305552,305565] [2022-11-02 20:07:18,942 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_9a1cc396-87d7-4e8b-8814-155cc85f40a8/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i[305720,305733] [2022-11-02 20:07:18,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:07:19,161 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:07:19,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19 WrapperNode [2022-11-02 20:07:19,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:07:19,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:07:19,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:07:19,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:07:19,171 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:07:19" (1/1) ... [2022-11-02 20:07:19,275 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:07:19" (1/1) ... [2022-11-02 20:07:19,475 INFO L138 Inliner]: procedures = 411, calls = 1991, calls flagged for inlining = 210, calls inlined = 187, statements flattened = 4406 [2022-11-02 20:07:19,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:07:19,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:07:19,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:07:19,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:07:19,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,681 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:07:19,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:07:19,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:07:19,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:07:19,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (1/1) ... [2022-11-02 20:07:19,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:07:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:07:19,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:07:19,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a1cc396-87d7-4e8b-8814-155cc85f40a8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:07:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure dnet_probe [2022-11-02 20:07:19,820 INFO L138 BoogieDeclarations]: Found implementation of procedure dnet_probe [2022-11-02 20:07:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:07:19,820 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:07:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:07:19,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:07:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-11-02 20:07:19,821 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-11-02 20:07:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 20:07:19,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 20:07:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-02 20:07:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-02 20:07:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_61 [2022-11-02 20:07:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_61 [2022-11-02 20:07:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure __dnet_set_hwaddr [2022-11-02 20:07:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __dnet_set_hwaddr [2022-11-02 20:07:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-02 20:07:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-02 20:07:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-11-02 20:07:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-11-02 20:07:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-11-02 20:07:19,824 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-11-02 20:07:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-11-02 20:07:19,824 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-11-02 20:07:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-02 20:07:19,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-02 20:07:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:07:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-11-02 20:07:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-11-02 20:07:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-02 20:07:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-02 20:07:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:07:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-11-02 20:07:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-11-02 20:07:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:07:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-02 20:07:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-02 20:07:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:07:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-11-02 20:07:19,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-11-02 20:07:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure dnet_reset_hw [2022-11-02 20:07:19,827 INFO L138 BoogieDeclarations]: Found implementation of procedure dnet_reset_hw [2022-11-02 20:07:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-11-02 20:07:19,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-11-02 20:07:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:07:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-11-02 20:07:19,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-11-02 20:07:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2022-11-02 20:07:19,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2022-11-02 20:07:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_2 [2022-11-02 20:07:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_2 [2022-11-02 20:07:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:07:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-11-02 20:07:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-11-02 20:07:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:07:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:07:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-02 20:07:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-02 20:07:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:07:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:07:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:07:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:07:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:07:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-11-02 20:07:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-11-02 20:07:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 20:07:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 20:07:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-11-02 20:07:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-11-02 20:07:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-11-02 20:07:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-11-02 20:07:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-11-02 20:07:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-11-02 20:07:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-02 20:07:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-02 20:07:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:07:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:07:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-11-02 20:07:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-11-02 20:07:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_free [2022-11-02 20:07:19,835 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_free [2022-11-02 20:07:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:07:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:07:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:07:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:07:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_unregister [2022-11-02 20:07:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_unregister [2022-11-02 20:07:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 20:07:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 20:07:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_dnet [2022-11-02 20:07:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_dnet [2022-11-02 20:07:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-02 20:07:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-02 20:07:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure dnet_readw_mac [2022-11-02 20:07:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure dnet_readw_mac [2022-11-02 20:07:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:07:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:07:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:07:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-02 20:07:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-02 20:07:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-02 20:07:19,839 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-02 20:07:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-02 20:07:19,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-02 20:07:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-11-02 20:07:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-11-02 20:07:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure dnet_close [2022-11-02 20:07:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure dnet_close [2022-11-02 20:07:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure __be16_to_cpup [2022-11-02 20:07:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __be16_to_cpup [2022-11-02 20:07:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure dnet_handle_link_change [2022-11-02 20:07:19,841 INFO L138 BoogieDeclarations]: Found implementation of procedure dnet_handle_link_change [2022-11-02 20:07:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-02 20:07:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-02 20:07:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-02 20:07:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-02 20:07:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure dnet_writew_mac [2022-11-02 20:07:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure dnet_writew_mac [2022-11-02 20:07:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-02 20:07:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-02 20:07:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:07:19,910 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:07:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:07:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:07:19,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:07:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure dnet_remove [2022-11-02 20:07:19,911 INFO L138 BoogieDeclarations]: Found implementation of procedure dnet_remove [2022-11-02 20:07:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-02 20:07:19,911 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-02 20:07:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure dnet_open [2022-11-02 20:07:19,912 INFO L138 BoogieDeclarations]: Found implementation of procedure dnet_open [2022-11-02 20:07:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure phy_connect [2022-11-02 20:07:19,912 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_connect [2022-11-02 20:07:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-02 20:07:19,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-02 20:07:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-11-02 20:07:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-11-02 20:07:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:07:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-11-02 20:07:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-11-02 20:07:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-02 20:07:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-02 20:07:20,697 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:07:20,700 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:07:21,823 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:07:27,482 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-11-02 20:07:27,567 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:07:27,582 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:07:27,583 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:07:27,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:07:27 BoogieIcfgContainer [2022-11-02 20:07:27,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:07:27,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:07:27,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:07:27,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:07:27,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:07:15" (1/3) ... [2022-11-02 20:07:27,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14baadce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:07:27, skipping insertion in model container [2022-11-02 20:07:27,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:19" (2/3) ... [2022-11-02 20:07:27,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14baadce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:07:27, skipping insertion in model container [2022-11-02 20:07:27,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:07:27" (3/3) ... [2022-11-02 20:07:27,595 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-dnet.cil.i [2022-11-02 20:07:27,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:07:27,614 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-02 20:07:27,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:07:27,703 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;@b73f3d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:07:27,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-02 20:07:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 1366 states, 977 states have (on average 1.2620266120777892) internal successors, (1233), 990 states have internal predecessors, (1233), 324 states have call successors, (324), 63 states have call predecessors, (324), 62 states have return successors, (317), 315 states have call predecessors, (317), 317 states have call successors, (317) [2022-11-02 20:07:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 20:07:27,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:07:27,729 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:27,729 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:07:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1829789727, now seen corresponding path program 1 times [2022-11-02 20:07:27,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:27,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220970769] [2022-11-02 20:07:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:27,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:07:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:07:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:07:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:07:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:07:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:07:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:07:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:07:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:07:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:07:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:07:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:07:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-11-02 20:07:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220970769] [2022-11-02 20:07:28,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220970769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:28,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:28,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:07:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62345459] [2022-11-02 20:07:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:29,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:07:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:29,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:07:29,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:07:29,051 INFO L87 Difference]: Start difference. First operand has 1366 states, 977 states have (on average 1.2620266120777892) internal successors, (1233), 990 states have internal predecessors, (1233), 324 states have call successors, (324), 63 states have call predecessors, (324), 62 states have return successors, (317), 315 states have call predecessors, (317), 317 states have call successors, (317) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:07:32,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:07:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:07:35,720 INFO L93 Difference]: Finished difference Result 3992 states and 5626 transitions. [2022-11-02 20:07:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:07:35,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 134 [2022-11-02 20:07:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:07:35,789 INFO L225 Difference]: With dead ends: 3992 [2022-11-02 20:07:35,790 INFO L226 Difference]: Without dead ends: 2639 [2022-11-02 20:07:35,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:07:35,812 INFO L413 NwaCegarLoop]: 2018 mSDtfsCounter, 2134 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 830 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 4072 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 830 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:07:35,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2421 Valid, 4072 Invalid, 2146 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [830 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-02 20:07:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-11-02 20:07:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2611. [2022-11-02 20:07:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 1888 states have (on average 1.257415254237288) internal successors, (2374), 1912 states have internal predecessors, (2374), 599 states have call successors, (599), 122 states have call predecessors, (599), 121 states have return successors, (596), 592 states have call predecessors, (596), 596 states have call successors, (596) [2022-11-02 20:07:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3569 transitions. [2022-11-02 20:07:36,114 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3569 transitions. Word has length 134 [2022-11-02 20:07:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:07:36,115 INFO L495 AbstractCegarLoop]: Abstraction has 2611 states and 3569 transitions. [2022-11-02 20:07:36,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:07:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3569 transitions. [2022-11-02 20:07:36,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-02 20:07:36,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:07:36,120 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:36,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:07:36,120 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:07:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash 493076079, now seen corresponding path program 1 times [2022-11-02 20:07:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:36,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815326884] [2022-11-02 20:07:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:07:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:07:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:07:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:07:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:07:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:07:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:07:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:07:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:07:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:07:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:07:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:07:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-11-02 20:07:36,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:36,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815326884] [2022-11-02 20:07:36,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815326884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:36,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:36,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:07:36,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301020679] [2022-11-02 20:07:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:36,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:07:36,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:36,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:07:36,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:07:36,637 INFO L87 Difference]: Start difference. First operand 2611 states and 3569 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:07:39,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:07:43,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:07:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:07:45,069 INFO L93 Difference]: Finished difference Result 7633 states and 10625 transitions. [2022-11-02 20:07:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:07:45,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 138 [2022-11-02 20:07:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:07:45,103 INFO L225 Difference]: With dead ends: 7633 [2022-11-02 20:07:45,103 INFO L226 Difference]: Without dead ends: 5047 [2022-11-02 20:07:45,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:07:45,114 INFO L413 NwaCegarLoop]: 2157 mSDtfsCounter, 2038 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 842 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 4337 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:07:45,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2276 Valid, 4337 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 1297 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-11-02 20:07:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2022-11-02 20:07:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 4992. [2022-11-02 20:07:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4992 states, 3630 states have (on average 1.2575757575757576) internal successors, (4565), 3684 states have internal predecessors, (4565), 1114 states have call successors, (1114), 242 states have call predecessors, (1114), 245 states have return successors, (1303), 1095 states have call predecessors, (1303), 1111 states have call successors, (1303) [2022-11-02 20:07:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4992 states to 4992 states and 6982 transitions. [2022-11-02 20:07:45,383 INFO L78 Accepts]: Start accepts. Automaton has 4992 states and 6982 transitions. Word has length 138 [2022-11-02 20:07:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:07:45,384 INFO L495 AbstractCegarLoop]: Abstraction has 4992 states and 6982 transitions. [2022-11-02 20:07:45,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:07:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4992 states and 6982 transitions. [2022-11-02 20:07:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:07:45,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:07:45,392 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:45,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:07:45,392 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:07:45,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1667436356, now seen corresponding path program 1 times [2022-11-02 20:07:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150084024] [2022-11-02 20:07:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:07:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:07:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:07:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:07:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:07:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:07:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:07:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:07:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:07:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:07:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:07:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:07:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-11-02 20:07:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150084024] [2022-11-02 20:07:45,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150084024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:45,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:45,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:07:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125448485] [2022-11-02 20:07:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:45,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:07:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:07:45,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:07:45,941 INFO L87 Difference]: Start difference. First operand 4992 states and 6982 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:07:49,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:07:51,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:07:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:07:54,437 INFO L93 Difference]: Finished difference Result 14132 states and 19680 transitions. [2022-11-02 20:07:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:07:54,438 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 145 [2022-11-02 20:07:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:07:54,508 INFO L225 Difference]: With dead ends: 14132 [2022-11-02 20:07:54,508 INFO L226 Difference]: Without dead ends: 9165 [2022-11-02 20:07:54,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:07:54,537 INFO L413 NwaCegarLoop]: 2075 mSDtfsCounter, 1718 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 799 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1977 SdHoareTripleChecker+Valid, 3993 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:07:54,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1977 Valid, 3993 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 1427 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-11-02 20:07:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9165 states. [2022-11-02 20:07:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9165 to 9086. [2022-11-02 20:07:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9086 states, 6558 states have (on average 1.2447392497712717) internal successors, (8163), 6670 states have internal predecessors, (8163), 2052 states have call successors, (2052), 470 states have call predecessors, (2052), 473 states have return successors, (2249), 2005 states have call predecessors, (2249), 2049 states have call successors, (2249) [2022-11-02 20:07:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 12464 transitions. [2022-11-02 20:07:55,119 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 12464 transitions. Word has length 145 [2022-11-02 20:07:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:07:55,120 INFO L495 AbstractCegarLoop]: Abstraction has 9086 states and 12464 transitions. [2022-11-02 20:07:55,121 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:07:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 12464 transitions. [2022-11-02 20:07:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-02 20:07:55,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:07:55,127 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:55,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:07:55,128 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:07:55,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash -656611999, now seen corresponding path program 1 times [2022-11-02 20:07:55,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794445288] [2022-11-02 20:07:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:55,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:07:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:07:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:07:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:07:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:07:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:07:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:07:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:07:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:07:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:07:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:07:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:07:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-02 20:07:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-11-02 20:07:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794445288] [2022-11-02 20:07:55,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794445288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:55,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:55,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:07:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376736706] [2022-11-02 20:07:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:55,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:07:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:07:55,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:07:55,541 INFO L87 Difference]: Start difference. First operand 9086 states and 12464 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:08:00,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:08:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:01,784 INFO L93 Difference]: Finished difference Result 24640 states and 34066 transitions. [2022-11-02 20:08:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:08:01,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 153 [2022-11-02 20:08:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:01,894 INFO L225 Difference]: With dead ends: 24640 [2022-11-02 20:08:01,895 INFO L226 Difference]: Without dead ends: 15579 [2022-11-02 20:08:01,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:01,931 INFO L413 NwaCegarLoop]: 1944 mSDtfsCounter, 1757 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 832 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 832 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:01,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 3970 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [832 Valid, 1291 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-11-02 20:08:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15579 states. [2022-11-02 20:08:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15579 to 15452. [2022-11-02 20:08:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15452 states, 11066 states have (on average 1.2343213446593169) internal successors, (13659), 11278 states have internal predecessors, (13659), 3492 states have call successors, (3492), 896 states have call predecessors, (3492), 891 states have return successors, (4189), 3369 states have call predecessors, (4189), 3489 states have call successors, (4189) [2022-11-02 20:08:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15452 states to 15452 states and 21340 transitions. [2022-11-02 20:08:02,943 INFO L78 Accepts]: Start accepts. Automaton has 15452 states and 21340 transitions. Word has length 153 [2022-11-02 20:08:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:02,943 INFO L495 AbstractCegarLoop]: Abstraction has 15452 states and 21340 transitions. [2022-11-02 20:08:02,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:08:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15452 states and 21340 transitions. [2022-11-02 20:08:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-02 20:08:02,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:02,948 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 10, 10, 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:08:02,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:08:02,948 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:08:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2109483455, now seen corresponding path program 1 times [2022-11-02 20:08:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:02,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945975429] [2022-11-02 20:08:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:08:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:08:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:08:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:08:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:08:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:08:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 20:08:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-02 20:08:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:08:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-11-02 20:08:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:03,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945975429] [2022-11-02 20:08:03,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945975429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:03,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:03,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:08:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410212760] [2022-11-02 20:08:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:03,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:08:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:03,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:08:03,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:08:03,387 INFO L87 Difference]: Start difference. First operand 15452 states and 21340 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-02 20:08:08,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:08:10,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:08:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:11,850 INFO L93 Difference]: Finished difference Result 29258 states and 40524 transitions. [2022-11-02 20:08:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:08:11,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 169 [2022-11-02 20:08:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:11,912 INFO L225 Difference]: With dead ends: 29258 [2022-11-02 20:08:11,912 INFO L226 Difference]: Without dead ends: 13831 [2022-11-02 20:08:11,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:11,961 INFO L413 NwaCegarLoop]: 2983 mSDtfsCounter, 1751 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 647 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:11,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 5457 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 1384 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-11-02 20:08:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2022-11-02 20:08:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 13739. [2022-11-02 20:08:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13739 states, 9943 states have (on average 1.2314190888061953) internal successors, (12244), 10141 states have internal predecessors, (12244), 3002 states have call successors, (3002), 793 states have call predecessors, (3002), 791 states have return successors, (3671), 2886 states have call predecessors, (3671), 2999 states have call successors, (3671) [2022-11-02 20:08:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13739 states to 13739 states and 18917 transitions. [2022-11-02 20:08:12,676 INFO L78 Accepts]: Start accepts. Automaton has 13739 states and 18917 transitions. Word has length 169 [2022-11-02 20:08:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:12,676 INFO L495 AbstractCegarLoop]: Abstraction has 13739 states and 18917 transitions. [2022-11-02 20:08:12,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-02 20:08:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13739 states and 18917 transitions. [2022-11-02 20:08:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-02 20:08:12,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:12,681 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:12,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:08:12,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:08:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash -844179788, now seen corresponding path program 1 times [2022-11-02 20:08:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:12,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170846109] [2022-11-02 20:08:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:12,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:08:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:08:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:08:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:08:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:08:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:08:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:08:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:08:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:08:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:08:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:08:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:08:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:08:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2022-11-02 20:08:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:13,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170846109] [2022-11-02 20:08:13,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170846109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:13,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:13,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:08:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817058335] [2022-11-02 20:08:13,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:13,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:08:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:13,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:08:13,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:08:13,190 INFO L87 Difference]: Start difference. First operand 13739 states and 18917 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:08:18,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:08:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:19,265 INFO L93 Difference]: Finished difference Result 40460 states and 55934 transitions. [2022-11-02 20:08:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:08:19,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 186 [2022-11-02 20:08:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:19,457 INFO L225 Difference]: With dead ends: 40460 [2022-11-02 20:08:19,458 INFO L226 Difference]: Without dead ends: 26815 [2022-11-02 20:08:19,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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:19,494 INFO L413 NwaCegarLoop]: 2073 mSDtfsCounter, 2103 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 844 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:19,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 4161 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 1310 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-11-02 20:08:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26815 states. [2022-11-02 20:08:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26815 to 26673. [2022-11-02 20:08:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26673 states, 19350 states have (on average 1.23343669250646) internal successors, (23867), 19704 states have internal predecessors, (23867), 5787 states have call successors, (5787), 1536 states have call predecessors, (5787), 1533 states have return successors, (7128), 5596 states have call predecessors, (7128), 5784 states have call successors, (7128) [2022-11-02 20:08:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26673 states to 26673 states and 36782 transitions. [2022-11-02 20:08:21,023 INFO L78 Accepts]: Start accepts. Automaton has 26673 states and 36782 transitions. Word has length 186 [2022-11-02 20:08:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:21,024 INFO L495 AbstractCegarLoop]: Abstraction has 26673 states and 36782 transitions. [2022-11-02 20:08:21,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:08:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 26673 states and 36782 transitions. [2022-11-02 20:08:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-02 20:08:21,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:21,028 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:21,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:08:21,029 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:08:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash -421477962, now seen corresponding path program 1 times [2022-11-02 20:08:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:21,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69164138] [2022-11-02 20:08:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:08:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:08:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:08:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:08:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:08:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:08:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:08:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:08:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:08:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:08:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:22,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:22,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:08:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:08:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:22,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:08:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2022-11-02 20:08:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69164138] [2022-11-02 20:08:22,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69164138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:22,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:22,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:08:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301516688] [2022-11-02 20:08:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:22,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:08:22,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:08:22,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:08:22,073 INFO L87 Difference]: Start difference. First operand 26673 states and 36782 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:08:27,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:08:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:28,295 INFO L93 Difference]: Finished difference Result 26799 states and 37085 transitions. [2022-11-02 20:08:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:08:28,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 186 [2022-11-02 20:08:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:28,425 INFO L225 Difference]: With dead ends: 26799 [2022-11-02 20:08:28,425 INFO L226 Difference]: Without dead ends: 26797 [2022-11-02 20:08:28,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 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:08:28,441 INFO L413 NwaCegarLoop]: 1751 mSDtfsCounter, 1812 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 567 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:28,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2015 Valid, 4957 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 1682 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-11-02 20:08:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26797 states. [2022-11-02 20:08:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26797 to 26677. [2022-11-02 20:08:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26677 states, 19353 states have (on average 1.2334005063814395) internal successors, (23870), 19707 states have internal predecessors, (23870), 5787 states have call successors, (5787), 1537 states have call predecessors, (5787), 1534 states have return successors, (7128), 5596 states have call predecessors, (7128), 5784 states have call successors, (7128) [2022-11-02 20:08:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26677 states to 26677 states and 36785 transitions. [2022-11-02 20:08:30,081 INFO L78 Accepts]: Start accepts. Automaton has 26677 states and 36785 transitions. Word has length 186 [2022-11-02 20:08:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:30,087 INFO L495 AbstractCegarLoop]: Abstraction has 26677 states and 36785 transitions. [2022-11-02 20:08:30,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:08:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 26677 states and 36785 transitions. [2022-11-02 20:08:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-11-02 20:08:30,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:30,094 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:30,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:08:30,094 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:08:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:30,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2049601018, now seen corresponding path program 1 times [2022-11-02 20:08:30,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:30,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642732200] [2022-11-02 20:08:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:30,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:08:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:08:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:08:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:08:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:08:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:08:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:08:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:08:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:08:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:08:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:08:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:08:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:08:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:08:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2022-11-02 20:08:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:31,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642732200] [2022-11-02 20:08:31,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642732200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:31,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:31,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:08:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151174266] [2022-11-02 20:08:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:31,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:08:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:08:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:08:31,123 INFO L87 Difference]: Start difference. First operand 26677 states and 36785 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:08:36,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:08:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:36,869 INFO L93 Difference]: Finished difference Result 26803 states and 37088 transitions. [2022-11-02 20:08:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:08:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 191 [2022-11-02 20:08:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:36,978 INFO L225 Difference]: With dead ends: 26803 [2022-11-02 20:08:36,979 INFO L226 Difference]: Without dead ends: 26801 [2022-11-02 20:08:36,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:08:36,991 INFO L413 NwaCegarLoop]: 1754 mSDtfsCounter, 1804 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 566 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:36,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 4960 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 1682 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-11-02 20:08:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26801 states. [2022-11-02 20:08:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26801 to 26681. [2022-11-02 20:08:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26681 states, 19356 states have (on average 1.2333643314734448) internal successors, (23873), 19710 states have internal predecessors, (23873), 5787 states have call successors, (5787), 1538 states have call predecessors, (5787), 1535 states have return successors, (7128), 5596 states have call predecessors, (7128), 5784 states have call successors, (7128) [2022-11-02 20:08:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26681 states to 26681 states and 36788 transitions. [2022-11-02 20:08:38,582 INFO L78 Accepts]: Start accepts. Automaton has 26681 states and 36788 transitions. Word has length 191 [2022-11-02 20:08:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:38,583 INFO L495 AbstractCegarLoop]: Abstraction has 26681 states and 36788 transitions. [2022-11-02 20:08:38,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:08:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 26681 states and 36788 transitions. [2022-11-02 20:08:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-11-02 20:08:38,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:38,587 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:38,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:08:38,587 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:08:38,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:38,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2110594058, now seen corresponding path program 1 times [2022-11-02 20:08:38,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:38,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804016974] [2022-11-02 20:08:38,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:38,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:08:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:08:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:08:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:08:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:08:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:08:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:08:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:08:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:08:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:08:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:08:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:08:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:08:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:08:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:08:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2022-11-02 20:08:39,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:39,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804016974] [2022-11-02 20:08:39,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804016974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:39,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:39,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:08:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496221771] [2022-11-02 20:08:39,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:39,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:08:39,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:08:39,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:08:39,283 INFO L87 Difference]: Start difference. First operand 26681 states and 36788 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:08:44,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:08:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:44,933 INFO L93 Difference]: Finished difference Result 26807 states and 37091 transitions. [2022-11-02 20:08:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:08:44,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 196 [2022-11-02 20:08:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:45,039 INFO L225 Difference]: With dead ends: 26807 [2022-11-02 20:08:45,039 INFO L226 Difference]: Without dead ends: 26805 [2022-11-02 20:08:45,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 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:08:45,054 INFO L413 NwaCegarLoop]: 1754 mSDtfsCounter, 1804 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:45,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 4960 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 20:08:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26805 states. [2022-11-02 20:08:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26805 to 26685. [2022-11-02 20:08:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26685 states, 19359 states have (on average 1.2333281677772612) internal successors, (23876), 19713 states have internal predecessors, (23876), 5787 states have call successors, (5787), 1539 states have call predecessors, (5787), 1536 states have return successors, (7128), 5596 states have call predecessors, (7128), 5784 states have call successors, (7128) [2022-11-02 20:08:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26685 states to 26685 states and 36791 transitions. [2022-11-02 20:08:46,655 INFO L78 Accepts]: Start accepts. Automaton has 26685 states and 36791 transitions. Word has length 196 [2022-11-02 20:08:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:46,655 INFO L495 AbstractCegarLoop]: Abstraction has 26685 states and 36791 transitions. [2022-11-02 20:08:46,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:08:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 26685 states and 36791 transitions. [2022-11-02 20:08:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-11-02 20:08:46,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:46,659 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:46,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:08:46,659 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:08:46,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1806834886, now seen corresponding path program 1 times [2022-11-02 20:08:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:46,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89771255] [2022-11-02 20:08:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:08:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:08:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:08:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:08:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:08:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:08:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:08:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:08:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:08:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:08:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:08:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:08:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:08:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:08:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:08:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:08:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-11-02 20:08:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:47,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89771255] [2022-11-02 20:08:47,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89771255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:47,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:47,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:08:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550865466] [2022-11-02 20:08:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:47,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:08:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:08:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:08:47,593 INFO L87 Difference]: Start difference. First operand 26685 states and 36791 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:08:52,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:08:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:53,550 INFO L93 Difference]: Finished difference Result 26811 states and 37094 transitions. [2022-11-02 20:08:53,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:08:53,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 201 [2022-11-02 20:08:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:53,755 INFO L225 Difference]: With dead ends: 26811 [2022-11-02 20:08:53,755 INFO L226 Difference]: Without dead ends: 26809 [2022-11-02 20:08:53,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 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:08:53,768 INFO L413 NwaCegarLoop]: 1754 mSDtfsCounter, 1804 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 564 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:53,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 4960 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 1682 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-11-02 20:08:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26809 states. [2022-11-02 20:08:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26809 to 26689. [2022-11-02 20:08:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26689 states, 19362 states have (on average 1.233292015287677) internal successors, (23879), 19716 states have internal predecessors, (23879), 5787 states have call successors, (5787), 1540 states have call predecessors, (5787), 1537 states have return successors, (7128), 5596 states have call predecessors, (7128), 5784 states have call successors, (7128) [2022-11-02 20:08:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26689 states to 26689 states and 36794 transitions. [2022-11-02 20:08:55,485 INFO L78 Accepts]: Start accepts. Automaton has 26689 states and 36794 transitions. Word has length 201 [2022-11-02 20:08:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:55,486 INFO L495 AbstractCegarLoop]: Abstraction has 26689 states and 36794 transitions. [2022-11-02 20:08:55,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:08:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 26689 states and 36794 transitions. [2022-11-02 20:08:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-02 20:08:55,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:55,489 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:55,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:08:55,490 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:08:55,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1516299830, now seen corresponding path program 1 times [2022-11-02 20:08:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:55,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518165071] [2022-11-02 20:08:55,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:55,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:08:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:08:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:08:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:08:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:08:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:08:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:08:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:08:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:08:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:08:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:08:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:08:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:08:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:08:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:08:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:08:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:08:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:08:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:08:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:08:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:08:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:08:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:08:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2022-11-02 20:08:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:56,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518165071] [2022-11-02 20:08:56,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518165071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:56,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:56,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:08:56,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290467668] [2022-11-02 20:08:56,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:56,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:08:56,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:56,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:08:56,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:08:56,179 INFO L87 Difference]: Start difference. First operand 26689 states and 36794 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 20:09:01,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:09:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:01,950 INFO L93 Difference]: Finished difference Result 26815 states and 37097 transitions. [2022-11-02 20:09:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 206 [2022-11-02 20:09:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:02,049 INFO L225 Difference]: With dead ends: 26815 [2022-11-02 20:09:02,049 INFO L226 Difference]: Without dead ends: 26813 [2022-11-02 20:09:02,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 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:09:02,069 INFO L413 NwaCegarLoop]: 1754 mSDtfsCounter, 1804 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 563 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:02,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 4960 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 1682 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-11-02 20:09:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26813 states. [2022-11-02 20:09:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26813 to 26693. [2022-11-02 20:09:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26693 states, 19365 states have (on average 1.2332558739994837) internal successors, (23882), 19719 states have internal predecessors, (23882), 5787 states have call successors, (5787), 1541 states have call predecessors, (5787), 1538 states have return successors, (7128), 5596 states have call predecessors, (7128), 5784 states have call successors, (7128) [2022-11-02 20:09:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26693 states to 26693 states and 36797 transitions. [2022-11-02 20:09:03,665 INFO L78 Accepts]: Start accepts. Automaton has 26693 states and 36797 transitions. Word has length 206 [2022-11-02 20:09:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:03,666 INFO L495 AbstractCegarLoop]: Abstraction has 26693 states and 36797 transitions. [2022-11-02 20:09:03,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 20:09:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26693 states and 36797 transitions. [2022-11-02 20:09:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-11-02 20:09:03,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:03,670 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:03,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:09:03,670 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:09:03,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2147387270, now seen corresponding path program 1 times [2022-11-02 20:09:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:03,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765125458] [2022-11-02 20:09:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:09:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:09:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:09:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:09:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:09:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:09:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:09:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:09:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:09:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:09:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:09:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:09:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:09:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:09:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:09:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:09:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:09:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 20:09:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-11-02 20:09:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:04,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765125458] [2022-11-02 20:09:04,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765125458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:04,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:04,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:09:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972770522] [2022-11-02 20:09:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:04,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:04,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:04,407 INFO L87 Difference]: Start difference. First operand 26693 states and 36797 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 20:09:09,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:09:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:10,528 INFO L93 Difference]: Finished difference Result 26819 states and 37100 transitions. [2022-11-02 20:09:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:10,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 211 [2022-11-02 20:09:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:10,617 INFO L225 Difference]: With dead ends: 26819 [2022-11-02 20:09:10,618 INFO L226 Difference]: Without dead ends: 26817 [2022-11-02 20:09:10,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 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:09:10,630 INFO L413 NwaCegarLoop]: 1754 mSDtfsCounter, 1804 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 562 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:10,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 4960 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 1682 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-11-02 20:09:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26817 states. [2022-11-02 20:09:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26817 to 26697. [2022-11-02 20:09:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26697 states, 19368 states have (on average 1.2332197439074764) internal successors, (23885), 19722 states have internal predecessors, (23885), 5787 states have call successors, (5787), 1542 states have call predecessors, (5787), 1539 states have return successors, (7128), 5596 states have call predecessors, (7128), 5784 states have call successors, (7128) [2022-11-02 20:09:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26697 states to 26697 states and 36800 transitions. [2022-11-02 20:09:12,031 INFO L78 Accepts]: Start accepts. Automaton has 26697 states and 36800 transitions. Word has length 211 [2022-11-02 20:09:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:12,031 INFO L495 AbstractCegarLoop]: Abstraction has 26697 states and 36800 transitions. [2022-11-02 20:09:12,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 20:09:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 26697 states and 36800 transitions. [2022-11-02 20:09:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-11-02 20:09:12,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:12,034 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:12,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:09:12,035 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:09:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:12,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1980942454, now seen corresponding path program 1 times [2022-11-02 20:09:12,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:12,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153594898] [2022-11-02 20:09:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:12,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:09:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:09:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:09:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:09:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:09:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:09:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:09:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:09:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:09:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:09:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:09:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:09:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:09:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:09:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:09:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:09:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:09:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 20:09:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 20:09:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-11-02 20:09:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:12,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153594898] [2022-11-02 20:09:12,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153594898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:12,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:12,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:09:12,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379359310] [2022-11-02 20:09:12,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:12,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:12,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:12,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:12,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:12,769 INFO L87 Difference]: Start difference. First operand 26697 states and 36800 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-02 20:09:18,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:09:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:19,335 INFO L93 Difference]: Finished difference Result 28019 states and 38247 transitions. [2022-11-02 20:09:19,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:09:19,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 216 [2022-11-02 20:09:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:19,408 INFO L225 Difference]: With dead ends: 28019 [2022-11-02 20:09:19,408 INFO L226 Difference]: Without dead ends: 28017 [2022-11-02 20:09:19,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 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:09:19,416 INFO L413 NwaCegarLoop]: 1769 mSDtfsCounter, 1675 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 550 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 5093 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:19,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 5093 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 1910 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-11-02 20:09:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28017 states. [2022-11-02 20:09:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28017 to 27897. [2022-11-02 20:09:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27897 states, 20107 states have (on average 1.2258417466553937) internal successors, (24648), 20485 states have internal predecessors, (24648), 5979 states have call successors, (5979), 1811 states have call predecessors, (5979), 1808 states have return successors, (7320), 5788 states have call predecessors, (7320), 5976 states have call successors, (7320) [2022-11-02 20:09:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27897 states to 27897 states and 37947 transitions. [2022-11-02 20:09:20,978 INFO L78 Accepts]: Start accepts. Automaton has 27897 states and 37947 transitions. Word has length 216 [2022-11-02 20:09:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:20,978 INFO L495 AbstractCegarLoop]: Abstraction has 27897 states and 37947 transitions. [2022-11-02 20:09:20,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-02 20:09:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 27897 states and 37947 transitions. [2022-11-02 20:09:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-11-02 20:09:20,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:20,982 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:20,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:09:20,983 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:09:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 530394554, now seen corresponding path program 1 times [2022-11-02 20:09:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:20,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729648190] [2022-11-02 20:09:20,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [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 25 [2022-11-02 20:09:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:09:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:09:21,739 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 1 [2022-11-02 20:09:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:09:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:09:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:09:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:09:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:09:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:09:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:09:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:09:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:09:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:09:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:09:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:09:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:09:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:09:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:09:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 20:09:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 20:09:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:09:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2022-11-02 20:09:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:21,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729648190] [2022-11-02 20:09:21,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729648190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:21,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:21,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:09:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614179188] [2022-11-02 20:09:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:21,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:21,907 INFO L87 Difference]: Start difference. First operand 27897 states and 37947 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 20:09:27,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:09:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:28,202 INFO L93 Difference]: Finished difference Result 28023 states and 38250 transitions. [2022-11-02 20:09:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:28,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 221 [2022-11-02 20:09:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:28,274 INFO L225 Difference]: With dead ends: 28023 [2022-11-02 20:09:28,274 INFO L226 Difference]: Without dead ends: 28021 [2022-11-02 20:09:28,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 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:09:28,283 INFO L413 NwaCegarLoop]: 1754 mSDtfsCounter, 1804 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 560 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:28,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 4960 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 1682 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 20:09:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28021 states. [2022-11-02 20:09:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28021 to 27901. [2022-11-02 20:09:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27901 states, 20110 states have (on average 1.2258080556936848) internal successors, (24651), 20488 states have internal predecessors, (24651), 5979 states have call successors, (5979), 1812 states have call predecessors, (5979), 1809 states have return successors, (7320), 5788 states have call predecessors, (7320), 5976 states have call successors, (7320) [2022-11-02 20:09:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27901 states to 27901 states and 37950 transitions. [2022-11-02 20:09:30,505 INFO L78 Accepts]: Start accepts. Automaton has 27901 states and 37950 transitions. Word has length 221 [2022-11-02 20:09:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:30,506 INFO L495 AbstractCegarLoop]: Abstraction has 27901 states and 37950 transitions. [2022-11-02 20:09:30,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 20:09:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 27901 states and 37950 transitions. [2022-11-02 20:09:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-11-02 20:09:30,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:30,510 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:30,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:09:30,510 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:09:30,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1443853642, now seen corresponding path program 1 times [2022-11-02 20:09:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:30,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644330430] [2022-11-02 20:09:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:09:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:09:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:09:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:09:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:09:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:09:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:09:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:09:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:09:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:09:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:09:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:09:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:09:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:09:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:09:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:09:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:09:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 20:09:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 20:09:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-02 20:09:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 20:09:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2022-11-02 20:09:31,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:31,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644330430] [2022-11-02 20:09:31,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644330430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:31,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:31,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:09:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136263502] [2022-11-02 20:09:31,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:31,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:31,265 INFO L87 Difference]: Start difference. First operand 27901 states and 37950 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 20:09:37,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:09:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:38,767 INFO L93 Difference]: Finished difference Result 28027 states and 38253 transitions. [2022-11-02 20:09:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:38,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 226 [2022-11-02 20:09:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:38,850 INFO L225 Difference]: With dead ends: 28027 [2022-11-02 20:09:38,851 INFO L226 Difference]: Without dead ends: 28025 [2022-11-02 20:09:38,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 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:09:38,863 INFO L413 NwaCegarLoop]: 1754 mSDtfsCounter, 1804 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 559 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:38,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 4960 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 1682 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 20:09:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2022-11-02 20:09:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 27905. [2022-11-02 20:09:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27905 states, 20113 states have (on average 1.225774374782479) internal successors, (24654), 20491 states have internal predecessors, (24654), 5979 states have call successors, (5979), 1813 states have call predecessors, (5979), 1810 states have return successors, (7320), 5788 states have call predecessors, (7320), 5976 states have call successors, (7320) [2022-11-02 20:09:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27905 states to 27905 states and 37953 transitions. [2022-11-02 20:09:40,932 INFO L78 Accepts]: Start accepts. Automaton has 27905 states and 37953 transitions. Word has length 226 [2022-11-02 20:09:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:40,933 INFO L495 AbstractCegarLoop]: Abstraction has 27905 states and 37953 transitions. [2022-11-02 20:09:40,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 20:09:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27905 states and 37953 transitions. [2022-11-02 20:09:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-11-02 20:09:40,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:40,939 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 10, 9, 9, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:40,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:09:40,939 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:09:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2046317439, now seen corresponding path program 1 times [2022-11-02 20:09:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:40,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460477851] [2022-11-02 20:09:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:09:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:09:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:09:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:09:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:09:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:09:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:09:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:09:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:09:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 20:09:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:09:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:09:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:09:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-02 20:09:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:09:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-02 20:09:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-02 20:09:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-02 20:09:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-02 20:09:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-02 20:09:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 20:09:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-02 20:09:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-11-02 20:09:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-02 20:09:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2022-11-02 20:09:41,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:41,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460477851] [2022-11-02 20:09:41,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460477851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:41,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:41,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:09:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959380895] [2022-11-02 20:09:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:41,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:41,886 INFO L87 Difference]: Start difference. First operand 27905 states and 37953 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-02 20:09:47,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:09:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:48,809 INFO L93 Difference]: Finished difference Result 28031 states and 38256 transitions. [2022-11-02 20:09:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 249 [2022-11-02 20:09:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:48,953 INFO L225 Difference]: With dead ends: 28031 [2022-11-02 20:09:48,954 INFO L226 Difference]: Without dead ends: 28029 [2022-11-02 20:09:48,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 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:09:48,971 INFO L413 NwaCegarLoop]: 1754 mSDtfsCounter, 1795 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:48,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1996 Valid, 4960 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-02 20:09:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28029 states. [2022-11-02 20:09:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28029 to 27909. [2022-11-02 20:09:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27909 states, 20116 states have (on average 1.2257407039172799) internal successors, (24657), 20494 states have internal predecessors, (24657), 5979 states have call successors, (5979), 1814 states have call predecessors, (5979), 1811 states have return successors, (7320), 5788 states have call predecessors, (7320), 5976 states have call successors, (7320) [2022-11-02 20:09:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27909 states to 27909 states and 37956 transitions. [2022-11-02 20:09:51,318 INFO L78 Accepts]: Start accepts. Automaton has 27909 states and 37956 transitions. Word has length 249 [2022-11-02 20:09:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:51,319 INFO L495 AbstractCegarLoop]: Abstraction has 27909 states and 37956 transitions. [2022-11-02 20:09:51,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-02 20:09:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 27909 states and 37956 transitions. [2022-11-02 20:09:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-02 20:09:51,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:51,324 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:51,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:09:51,325 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1209759793, now seen corresponding path program 1 times [2022-11-02 20:09:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:51,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088723482] [2022-11-02 20:09:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:09:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:09:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:09:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:09:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:09:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:09:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:09:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:09:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:09:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:09:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:09:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:09:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:09:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:09:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:09:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 20:09:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:09:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:09:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:09:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-02 20:09:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-02 20:09:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-02 20:09:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-11-02 20:09:51,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:51,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088723482] [2022-11-02 20:09:51,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088723482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:51,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:51,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:09:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324896045] [2022-11-02 20:09:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:51,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:51,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:51,778 INFO L87 Difference]: Start difference. First operand 27909 states and 37956 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-02 20:09:58,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:10:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:00,600 INFO L93 Difference]: Finished difference Result 67550 states and 92249 transitions. [2022-11-02 20:10:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:10:00,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 229 [2022-11-02 20:10:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:00,710 INFO L225 Difference]: With dead ends: 67550 [2022-11-02 20:10:00,710 INFO L226 Difference]: Without dead ends: 39735 [2022-11-02 20:10:00,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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:10:00,774 INFO L413 NwaCegarLoop]: 3323 mSDtfsCounter, 1714 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 596 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 6062 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:00,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1989 Valid, 6062 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 1389 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-11-02 20:10:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39735 states.