/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:20:01,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:20:01,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:20:01,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:20:01,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:20:01,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:20:01,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:20:01,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:20:01,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:20:01,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:20:01,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:20:01,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:20:01,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:20:01,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:20:01,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:20:01,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:20:01,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:20:01,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:20:01,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:20:01,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:20:01,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:20:01,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:20:01,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:20:01,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:20:01,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:20:01,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:20:01,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:20:01,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:20:01,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:20:01,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:20:01,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:20:01,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:20:01,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:20:01,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:20:01,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:20:01,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:20:01,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:20:01,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:20:01,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:20:01,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:20:01,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:20:01,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:20:01,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:20:01,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:20:01,320 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:20:01,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:20:01,321 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:20:01,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:20:01,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:20:01,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:20:01,323 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:20:01,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:20:01,323 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:20:01,323 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:20:01,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:20:01,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:20:01,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:20:01,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:20:01,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:20:01,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:20:01,325 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:20:01,325 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:20:01,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:20:01,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:20:01,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:20:01,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:20:01,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:20:01,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:20:01,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:20:01,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:20:01,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:20:01,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:20:01,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:20:01,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:20:01,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:20:01,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 21:20:01,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:20:01,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:20:01,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:20:01,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:20:01,791 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:20:01,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-10-15 21:20:01,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b9e3e7d/1a3629ad2b434be1aaf9210a4ee3d106/FLAG00d7259ec [2022-10-15 21:20:02,690 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:20:02,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-10-15 21:20:02,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b9e3e7d/1a3629ad2b434be1aaf9210a4ee3d106/FLAG00d7259ec [2022-10-15 21:20:02,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b9e3e7d/1a3629ad2b434be1aaf9210a4ee3d106 [2022-10-15 21:20:02,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:20:02,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:20:02,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:20:02,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:20:02,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:20:02,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:20:02" (1/1) ... [2022-10-15 21:20:02,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611433cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:02, skipping insertion in model container [2022-10-15 21:20:02,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:20:02" (1/1) ... [2022-10-15 21:20:02,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:20:02,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:20:03,455 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-10-15 21:20:03,456 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-10-15 21:20:03,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2022-10-15 21:20:03,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:20:03,996 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:20:04,050 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-10-15 21:20:04,051 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-10-15 21:20:04,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2022-10-15 21:20:04,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:20:04,226 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:20:04,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04 WrapperNode [2022-10-15 21:20:04,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:20:04,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:20:04,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:20:04,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:20:04,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,361 INFO L138 Inliner]: procedures = 114, calls = 288, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 918 [2022-10-15 21:20:04,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:20:04,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:20:04,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:20:04,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:20:04,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,504 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:20:04,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:20:04,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:20:04,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:20:04,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (1/1) ... [2022-10-15 21:20:04,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:20:04,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:20:04,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:20:04,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:20:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-10-15 21:20:04,665 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-10-15 21:20:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2022-10-15 21:20:04,665 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2022-10-15 21:20:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-15 21:20:04,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-15 21:20:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:20:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-10-15 21:20:04,666 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-10-15 21:20:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-10-15 21:20:04,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-10-15 21:20:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:20:04,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:20:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-10-15 21:20:04,667 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-10-15 21:20:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-10-15 21:20:04,667 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-10-15 21:20:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-10-15 21:20:04,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-10-15 21:20:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 21:20:04,667 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 21:20:04,668 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-10-15 21:20:04,668 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-10-15 21:20:04,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:20:04,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-15 21:20:04,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-15 21:20:04,668 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-10-15 21:20:04,669 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-10-15 21:20:04,669 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-10-15 21:20:04,669 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-10-15 21:20:04,669 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-10-15 21:20:04,669 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-10-15 21:20:04,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:20:04,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:20:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:20:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-10-15 21:20:04,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-10-15 21:20:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:20:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-10-15 21:20:04,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-10-15 21:20:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:20:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:20:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-10-15 21:20:04,671 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-10-15 21:20:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:20:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-10-15 21:20:04,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-10-15 21:20:04,672 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-10-15 21:20:04,672 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-10-15 21:20:04,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:20:04,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:20:04,672 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2022-10-15 21:20:04,672 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2022-10-15 21:20:04,672 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-10-15 21:20:04,673 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-10-15 21:20:04,673 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2022-10-15 21:20:04,673 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2022-10-15 21:20:04,673 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-10-15 21:20:04,673 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-10-15 21:20:04,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:20:04,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-15 21:20:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-15 21:20:04,674 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-10-15 21:20:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-10-15 21:20:04,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:20:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:20:04,955 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:20:04,958 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:20:05,172 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-15 21:20:06,350 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:20:06,375 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:20:06,375 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:20:06,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:20:06 BoogieIcfgContainer [2022-10-15 21:20:06,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:20:06,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:20:06,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:20:06,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:20:06,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:20:02" (1/3) ... [2022-10-15 21:20:06,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df05ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:20:06, skipping insertion in model container [2022-10-15 21:20:06,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:20:04" (2/3) ... [2022-10-15 21:20:06,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df05ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:20:06, skipping insertion in model container [2022-10-15 21:20:06,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:20:06" (3/3) ... [2022-10-15 21:20:06,394 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-10-15 21:20:06,419 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:20:06,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-10-15 21:20:06,530 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:20:06,543 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=FINITE_AUTOMATA, 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;@77935fd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:20:06,543 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-10-15 21:20:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 428 states, 298 states have (on average 1.4932885906040267) internal successors, (445), 355 states have internal predecessors, (445), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2022-10-15 21:20:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 21:20:06,575 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:06,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:20:06,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:06,585 INFO L85 PathProgramCache]: Analyzing trace with hash -606025898, now seen corresponding path program 1 times [2022-10-15 21:20:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617266697] [2022-10-15 21:20:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:07,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617266697] [2022-10-15 21:20:07,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617266697] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:07,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:07,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:20:07,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644864627] [2022-10-15 21:20:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:07,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:20:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:20:07,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:20:07,263 INFO L87 Difference]: Start difference. First operand has 428 states, 298 states have (on average 1.4932885906040267) internal successors, (445), 355 states have internal predecessors, (445), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:08,360 INFO L93 Difference]: Finished difference Result 1325 states and 1776 transitions. [2022-10-15 21:20:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:20:08,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-10-15 21:20:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:08,403 INFO L225 Difference]: With dead ends: 1325 [2022-10-15 21:20:08,403 INFO L226 Difference]: Without dead ends: 873 [2022-10-15 21:20:08,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-10-15 21:20:08,426 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 760 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:08,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1212 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-15 21:20:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-10-15 21:20:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 731. [2022-10-15 21:20:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 541 states have (on average 1.4805914972273568) internal successors, (801), 602 states have internal predecessors, (801), 100 states have call successors, (100), 48 states have call predecessors, (100), 48 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2022-10-15 21:20:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 999 transitions. [2022-10-15 21:20:08,630 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 999 transitions. Word has length 31 [2022-10-15 21:20:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:08,631 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 999 transitions. [2022-10-15 21:20:08,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 999 transitions. [2022-10-15 21:20:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 21:20:08,642 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:08,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10-15 21:20:08,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:20:08,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1955965, now seen corresponding path program 1 times [2022-10-15 21:20:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:08,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676448410] [2022-10-15 21:20:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:08,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:08,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:08,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:08,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:08,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676448410] [2022-10-15 21:20:08,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676448410] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:08,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:08,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:20:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917069854] [2022-10-15 21:20:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:08,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:20:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:08,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:20:08,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:20:08,873 INFO L87 Difference]: Start difference. First operand 731 states and 999 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:09,849 INFO L93 Difference]: Finished difference Result 2261 states and 3103 transitions. [2022-10-15 21:20:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:20:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-10-15 21:20:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:09,871 INFO L225 Difference]: With dead ends: 2261 [2022-10-15 21:20:09,871 INFO L226 Difference]: Without dead ends: 1546 [2022-10-15 21:20:09,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-10-15 21:20:09,883 INFO L413 NwaCegarLoop]: 642 mSDtfsCounter, 712 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:09,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1253 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 21:20:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-10-15 21:20:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1316. [2022-10-15 21:20:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1001 states have (on average 1.4765234765234765) internal successors, (1478), 1080 states have internal predecessors, (1478), 182 states have call successors, (182), 91 states have call predecessors, (182), 91 states have return successors, (178), 158 states have call predecessors, (178), 178 states have call successors, (178) [2022-10-15 21:20:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1838 transitions. [2022-10-15 21:20:10,031 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1838 transitions. Word has length 33 [2022-10-15 21:20:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:10,032 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1838 transitions. [2022-10-15 21:20:10,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1838 transitions. [2022-10-15 21:20:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 21:20:10,035 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:10,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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-10-15 21:20:10,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:20:10,036 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1189661605, now seen corresponding path program 1 times [2022-10-15 21:20:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:10,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626703754] [2022-10-15 21:20:10,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:10,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626703754] [2022-10-15 21:20:10,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626703754] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:10,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:10,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:20:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935091377] [2022-10-15 21:20:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:10,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:20:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:20:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:20:10,209 INFO L87 Difference]: Start difference. First operand 1316 states and 1838 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:11,259 INFO L93 Difference]: Finished difference Result 4088 states and 5742 transitions. [2022-10-15 21:20:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:20:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-10-15 21:20:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:11,285 INFO L225 Difference]: With dead ends: 4088 [2022-10-15 21:20:11,285 INFO L226 Difference]: Without dead ends: 2788 [2022-10-15 21:20:11,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-10-15 21:20:11,303 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 687 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:11,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1387 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 21:20:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2022-10-15 21:20:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2376. [2022-10-15 21:20:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 1833 states have (on average 1.475177304964539) internal successors, (2704), 1948 states have internal predecessors, (2704), 330 states have call successors, (330), 171 states have call predecessors, (330), 171 states have return successors, (322), 282 states have call predecessors, (322), 322 states have call successors, (322) [2022-10-15 21:20:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 3356 transitions. [2022-10-15 21:20:11,511 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 3356 transitions. Word has length 34 [2022-10-15 21:20:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:11,511 INFO L495 AbstractCegarLoop]: Abstraction has 2376 states and 3356 transitions. [2022-10-15 21:20:11,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 3356 transitions. [2022-10-15 21:20:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 21:20:11,517 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:11,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 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-10-15 21:20:11,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:20:11,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash 797000830, now seen corresponding path program 1 times [2022-10-15 21:20:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:11,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804520595] [2022-10-15 21:20:11,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:11,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:11,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804520595] [2022-10-15 21:20:11,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804520595] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:11,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:11,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:20:11,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632713858] [2022-10-15 21:20:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:11,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:20:11,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:11,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:20:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:20:11,783 INFO L87 Difference]: Start difference. First operand 2376 states and 3356 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:12,737 INFO L93 Difference]: Finished difference Result 6176 states and 9032 transitions. [2022-10-15 21:20:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:20:12,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-10-15 21:20:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:12,770 INFO L225 Difference]: With dead ends: 6176 [2022-10-15 21:20:12,770 INFO L226 Difference]: Without dead ends: 3816 [2022-10-15 21:20:12,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:20:12,789 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 386 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:12,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1393 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:20:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2022-10-15 21:20:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2536. [2022-10-15 21:20:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 1985 states have (on average 1.4549118387909319) internal successors, (2888), 2100 states have internal predecessors, (2888), 338 states have call successors, (338), 171 states have call predecessors, (338), 171 states have return successors, (330), 290 states have call predecessors, (330), 330 states have call successors, (330) [2022-10-15 21:20:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3556 transitions. [2022-10-15 21:20:13,067 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3556 transitions. Word has length 35 [2022-10-15 21:20:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:13,067 INFO L495 AbstractCegarLoop]: Abstraction has 2536 states and 3556 transitions. [2022-10-15 21:20:13,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3556 transitions. [2022-10-15 21:20:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 21:20:13,069 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:13,069 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 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-10-15 21:20:13,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:20:13,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting lock_torture_cleanupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1394469550, now seen corresponding path program 1 times [2022-10-15 21:20:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:13,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425227016] [2022-10-15 21:20:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:20:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:13,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:13,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425227016] [2022-10-15 21:20:13,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425227016] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:13,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:13,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:20:13,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036233372] [2022-10-15 21:20:13,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:13,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:20:13,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:13,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:20:13,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:20:13,248 INFO L87 Difference]: Start difference. First operand 2536 states and 3556 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:20:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:14,286 INFO L93 Difference]: Finished difference Result 7333 states and 10313 transitions. [2022-10-15 21:20:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:20:14,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-10-15 21:20:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:14,318 INFO L225 Difference]: With dead ends: 7333 [2022-10-15 21:20:14,319 INFO L226 Difference]: Without dead ends: 4485 [2022-10-15 21:20:14,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-10-15 21:20:14,333 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 663 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:14,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1391 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 21:20:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2022-10-15 21:20:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 3496. [2022-10-15 21:20:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 2761 states have (on average 1.4491126403477002) internal successors, (4001), 2879 states have internal predecessors, (4001), 450 states have call successors, (450), 247 states have call predecessors, (450), 243 states have return successors, (446), 405 states have call predecessors, (446), 446 states have call successors, (446) [2022-10-15 21:20:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4897 transitions. [2022-10-15 21:20:14,592 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4897 transitions. Word has length 38 [2022-10-15 21:20:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:14,594 INFO L495 AbstractCegarLoop]: Abstraction has 3496 states and 4897 transitions. [2022-10-15 21:20:14,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:20:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4897 transitions. [2022-10-15 21:20:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 21:20:14,596 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:14,596 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:20:14,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:20:14,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1448643951, now seen corresponding path program 1 times [2022-10-15 21:20:14,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:14,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542839248] [2022-10-15 21:20:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:14,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:14,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542839248] [2022-10-15 21:20:14,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542839248] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:20:14,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205265581] [2022-10-15 21:20:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:14,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:20:14,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:20:14,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:20:14,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:20:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:15,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:20:15,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:20:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:15,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:20:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:15,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205265581] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:20:15,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:20:15,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-10-15 21:20:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185068402] [2022-10-15 21:20:15,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:20:15,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:20:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:20:15,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:20:15,211 INFO L87 Difference]: Start difference. First operand 3496 states and 4897 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:17,067 INFO L93 Difference]: Finished difference Result 14410 states and 21925 transitions. [2022-10-15 21:20:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:20:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-10-15 21:20:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:17,150 INFO L225 Difference]: With dead ends: 14410 [2022-10-15 21:20:17,150 INFO L226 Difference]: Without dead ends: 10930 [2022-10-15 21:20:17,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:20:17,167 INFO L413 NwaCegarLoop]: 971 mSDtfsCounter, 1791 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:17,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 3150 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-15 21:20:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2022-10-15 21:20:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 3742. [2022-10-15 21:20:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 2985 states have (on average 1.450251256281407) internal successors, (4329), 3101 states have internal predecessors, (4329), 474 states have call successors, (474), 247 states have call predecessors, (474), 243 states have return successors, (470), 429 states have call predecessors, (470), 470 states have call successors, (470) [2022-10-15 21:20:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5273 transitions. [2022-10-15 21:20:17,665 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5273 transitions. Word has length 40 [2022-10-15 21:20:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:17,666 INFO L495 AbstractCegarLoop]: Abstraction has 3742 states and 5273 transitions. [2022-10-15 21:20:17,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5273 transitions. [2022-10-15 21:20:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 21:20:17,668 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:17,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 21:20:17,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 21:20:17,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 21:20:17,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1958290025, now seen corresponding path program 1 times [2022-10-15 21:20:17,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:17,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604153354] [2022-10-15 21:20:17,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:18,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:18,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:18,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:18,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604153354] [2022-10-15 21:20:18,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604153354] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:20:18,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595093783] [2022-10-15 21:20:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:18,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:20:18,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:20:18,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:20:18,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:20:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:18,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:20:18,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:20:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:18,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:20:18,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595093783] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:18,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:20:18,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-15 21:20:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595595313] [2022-10-15 21:20:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:18,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:20:18,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:20:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:20:18,309 INFO L87 Difference]: Start difference. First operand 3742 states and 5273 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:18,838 INFO L93 Difference]: Finished difference Result 6184 states and 9223 transitions. [2022-10-15 21:20:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:20:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-10-15 21:20:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:18,875 INFO L225 Difference]: With dead ends: 6184 [2022-10-15 21:20:18,876 INFO L226 Difference]: Without dead ends: 6180 [2022-10-15 21:20:18,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:20:18,881 INFO L413 NwaCegarLoop]: 791 mSDtfsCounter, 618 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:18,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1464 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:20:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6180 states. [2022-10-15 21:20:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6180 to 3714. [2022-10-15 21:20:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 2961 states have (on average 1.4322863897331983) internal successors, (4241), 3073 states have internal predecessors, (4241), 474 states have call successors, (474), 247 states have call predecessors, (474), 243 states have return successors, (470), 429 states have call predecessors, (470), 470 states have call successors, (470) [2022-10-15 21:20:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 5185 transitions. [2022-10-15 21:20:19,274 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 5185 transitions. Word has length 41 [2022-10-15 21:20:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:19,274 INFO L495 AbstractCegarLoop]: Abstraction has 3714 states and 5185 transitions. [2022-10-15 21:20:19,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 5185 transitions. [2022-10-15 21:20:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 21:20:19,278 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:19,278 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 21:20:19,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 21:20:19,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-15 21:20:19,493 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1678666271, now seen corresponding path program 1 times [2022-10-15 21:20:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:19,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435406859] [2022-10-15 21:20:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:19,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:19,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:19,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:19,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435406859] [2022-10-15 21:20:19,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435406859] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:19,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:19,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:20:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725758804] [2022-10-15 21:20:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:19,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:20:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:19,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:20:19,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:20:19,612 INFO L87 Difference]: Start difference. First operand 3714 states and 5185 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:20,545 INFO L93 Difference]: Finished difference Result 8852 states and 12649 transitions. [2022-10-15 21:20:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:20:20,546 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-10-15 21:20:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:20,575 INFO L225 Difference]: With dead ends: 8852 [2022-10-15 21:20:20,575 INFO L226 Difference]: Without dead ends: 5154 [2022-10-15 21:20:20,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:20:20,586 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 402 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:20,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1314 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:20:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states. [2022-10-15 21:20:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 3722. [2022-10-15 21:20:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 2969 states have (on average 1.4311215897608622) internal successors, (4249), 3081 states have internal predecessors, (4249), 474 states have call successors, (474), 247 states have call predecessors, (474), 243 states have return successors, (470), 429 states have call predecessors, (470), 470 states have call successors, (470) [2022-10-15 21:20:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5193 transitions. [2022-10-15 21:20:20,931 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5193 transitions. Word has length 44 [2022-10-15 21:20:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:20,931 INFO L495 AbstractCegarLoop]: Abstraction has 3722 states and 5193 transitions. [2022-10-15 21:20:20,932 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5193 transitions. [2022-10-15 21:20:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 21:20:20,934 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:20,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 21:20:20,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:20:20,935 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1336437347, now seen corresponding path program 1 times [2022-10-15 21:20:20,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:20,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262786149] [2022-10-15 21:20:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:20,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:21,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:21,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262786149] [2022-10-15 21:20:21,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262786149] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:21,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:21,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:20:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597208517] [2022-10-15 21:20:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:21,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:20:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:20:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:20:21,164 INFO L87 Difference]: Start difference. First operand 3722 states and 5193 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:22,192 INFO L93 Difference]: Finished difference Result 7853 states and 11006 transitions. [2022-10-15 21:20:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:20:22,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-10-15 21:20:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:22,212 INFO L225 Difference]: With dead ends: 7853 [2022-10-15 21:20:22,212 INFO L226 Difference]: Without dead ends: 4067 [2022-10-15 21:20:22,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:20:22,227 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 162 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:22,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1337 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 21:20:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2022-10-15 21:20:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3594. [2022-10-15 21:20:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 2849 states have (on average 1.4324324324324325) internal successors, (4081), 2961 states have internal predecessors, (4081), 466 states have call successors, (466), 247 states have call predecessors, (466), 243 states have return successors, (462), 421 states have call predecessors, (462), 462 states have call successors, (462) [2022-10-15 21:20:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 5009 transitions. [2022-10-15 21:20:22,523 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 5009 transitions. Word has length 44 [2022-10-15 21:20:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:22,524 INFO L495 AbstractCegarLoop]: Abstraction has 3594 states and 5009 transitions. [2022-10-15 21:20:22,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:20:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 5009 transitions. [2022-10-15 21:20:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-15 21:20:22,525 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:22,526 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:20:22,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:20:22,526 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting lock_torture_cleanupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash -841952832, now seen corresponding path program 1 times [2022-10-15 21:20:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:22,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594904161] [2022-10-15 21:20:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:22,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-15 21:20:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:22,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594904161] [2022-10-15 21:20:22,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594904161] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:22,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:22,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:20:22,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371391902] [2022-10-15 21:20:22,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:22,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:20:22,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:20:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:20:22,835 INFO L87 Difference]: Start difference. First operand 3594 states and 5009 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:20:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:24,061 INFO L93 Difference]: Finished difference Result 7789 states and 10881 transitions. [2022-10-15 21:20:24,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:20:24,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-10-15 21:20:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:24,080 INFO L225 Difference]: With dead ends: 7789 [2022-10-15 21:20:24,081 INFO L226 Difference]: Without dead ends: 4211 [2022-10-15 21:20:24,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:20:24,093 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 439 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:24,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1323 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-15 21:20:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2022-10-15 21:20:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 3690. [2022-10-15 21:20:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 2927 states have (on average 1.4287666552784422) internal successors, (4182), 3046 states have internal predecessors, (4182), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-15 21:20:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 5130 transitions. [2022-10-15 21:20:24,535 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 5130 transitions. Word has length 49 [2022-10-15 21:20:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:24,537 INFO L495 AbstractCegarLoop]: Abstraction has 3690 states and 5130 transitions. [2022-10-15 21:20:24,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:20:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 5130 transitions. [2022-10-15 21:20:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 21:20:24,539 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:24,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:20:24,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 21:20:24,539 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash 407721026, now seen corresponding path program 1 times [2022-10-15 21:20:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:24,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219482850] [2022-10-15 21:20:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:24,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 21:20:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:24,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 21:20:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:24,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:20:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:24,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-15 21:20:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219482850] [2022-10-15 21:20:24,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219482850] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:24,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:24,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:20:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090376408] [2022-10-15 21:20:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:24,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:20:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:20:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:20:24,817 INFO L87 Difference]: Start difference. First operand 3690 states and 5130 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-15 21:20:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:25,578 INFO L93 Difference]: Finished difference Result 7657 states and 10727 transitions. [2022-10-15 21:20:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:20:25,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-10-15 21:20:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:25,595 INFO L225 Difference]: With dead ends: 7657 [2022-10-15 21:20:25,595 INFO L226 Difference]: Without dead ends: 4127 [2022-10-15 21:20:25,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:20:25,605 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 647 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:25,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1027 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:20:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2022-10-15 21:20:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 3690. [2022-10-15 21:20:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 2927 states have (on average 1.4260334813802529) internal successors, (4174), 3046 states have internal predecessors, (4174), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-15 21:20:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 5122 transitions. [2022-10-15 21:20:25,927 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 5122 transitions. Word has length 65 [2022-10-15 21:20:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:25,927 INFO L495 AbstractCegarLoop]: Abstraction has 3690 states and 5122 transitions. [2022-10-15 21:20:25,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-15 21:20:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 5122 transitions. [2022-10-15 21:20:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-15 21:20:25,929 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:25,929 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:20:25,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:20:25,930 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2138713405, now seen corresponding path program 1 times [2022-10-15 21:20:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:25,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205886936] [2022-10-15 21:20:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:26,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 21:20:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:20:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:26,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:20:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-15 21:20:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:26,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205886936] [2022-10-15 21:20:26,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205886936] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:26,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:26,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:20:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107388697] [2022-10-15 21:20:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:26,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:20:26,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:20:26,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:20:26,127 INFO L87 Difference]: Start difference. First operand 3690 states and 5122 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 21:20:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:26,919 INFO L93 Difference]: Finished difference Result 7605 states and 10623 transitions. [2022-10-15 21:20:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:20:26,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-10-15 21:20:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:26,938 INFO L225 Difference]: With dead ends: 7605 [2022-10-15 21:20:26,939 INFO L226 Difference]: Without dead ends: 4075 [2022-10-15 21:20:26,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:20:26,951 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 626 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:26,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 991 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:20:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2022-10-15 21:20:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3638. [2022-10-15 21:20:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3638 states, 2879 states have (on average 1.416464050017367) internal successors, (4078), 2994 states have internal predecessors, (4078), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-15 21:20:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 5026 transitions. [2022-10-15 21:20:27,302 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 5026 transitions. Word has length 68 [2022-10-15 21:20:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:27,302 INFO L495 AbstractCegarLoop]: Abstraction has 3638 states and 5026 transitions. [2022-10-15 21:20:27,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 21:20:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 5026 transitions. [2022-10-15 21:20:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-10-15 21:20:27,304 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:27,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:20:27,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 21:20:27,305 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting lock_torture_stats_printErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:27,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1041502052, now seen corresponding path program 1 times [2022-10-15 21:20:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:27,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325100008] [2022-10-15 21:20:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:27,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:20:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:27,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 21:20:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:20:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-15 21:20:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:27,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:27,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325100008] [2022-10-15 21:20:27,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325100008] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:27,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:27,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:20:27,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502902334] [2022-10-15 21:20:27,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:27,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:20:27,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:27,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:20:27,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:20:27,615 INFO L87 Difference]: Start difference. First operand 3638 states and 5026 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-15 21:20:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:28,563 INFO L93 Difference]: Finished difference Result 4489 states and 6375 transitions. [2022-10-15 21:20:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:20:28,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2022-10-15 21:20:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:28,583 INFO L225 Difference]: With dead ends: 4489 [2022-10-15 21:20:28,584 INFO L226 Difference]: Without dead ends: 4483 [2022-10-15 21:20:28,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:20:28,588 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 239 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:28,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1284 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:20:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2022-10-15 21:20:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 3766. [2022-10-15 21:20:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 3007 states have (on average 1.4250083139341536) internal successors, (4285), 3122 states have internal predecessors, (4285), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-15 21:20:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 5233 transitions. [2022-10-15 21:20:29,042 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 5233 transitions. Word has length 75 [2022-10-15 21:20:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:29,043 INFO L495 AbstractCegarLoop]: Abstraction has 3766 states and 5233 transitions. [2022-10-15 21:20:29,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-15 21:20:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 5233 transitions. [2022-10-15 21:20:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-15 21:20:29,051 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:29,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:20:29,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 21:20:29,052 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting lock_torture_stats_printErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash 541071691, now seen corresponding path program 1 times [2022-10-15 21:20:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:29,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261084852] [2022-10-15 21:20:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:29,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:29,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:29,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:29,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:20:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:29,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 21:20:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:29,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:20:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:29,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-15 21:20:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:29,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261084852] [2022-10-15 21:20:29,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261084852] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:29,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:29,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:20:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563673594] [2022-10-15 21:20:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:29,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:20:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:20:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:20:29,353 INFO L87 Difference]: Start difference. First operand 3766 states and 5233 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 21:20:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:30,583 INFO L93 Difference]: Finished difference Result 7938 states and 11126 transitions. [2022-10-15 21:20:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:20:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2022-10-15 21:20:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:30,602 INFO L225 Difference]: With dead ends: 7938 [2022-10-15 21:20:30,603 INFO L226 Difference]: Without dead ends: 4292 [2022-10-15 21:20:30,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:20:30,615 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 390 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:30,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1334 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 21:20:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2022-10-15 21:20:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 3743. [2022-10-15 21:20:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 2984 states have (on average 1.4222520107238605) internal successors, (4244), 3099 states have internal predecessors, (4244), 475 states have call successors, (475), 254 states have call predecessors, (475), 252 states have return successors, (473), 427 states have call predecessors, (473), 473 states have call successors, (473) [2022-10-15 21:20:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5192 transitions. [2022-10-15 21:20:31,002 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5192 transitions. Word has length 78 [2022-10-15 21:20:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:31,002 INFO L495 AbstractCegarLoop]: Abstraction has 3743 states and 5192 transitions. [2022-10-15 21:20:31,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 21:20:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5192 transitions. [2022-10-15 21:20:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-10-15 21:20:31,004 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:31,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:20:31,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 21:20:31,005 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting lock_torture_cleanupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:31,006 INFO L85 PathProgramCache]: Analyzing trace with hash -165857091, now seen corresponding path program 1 times [2022-10-15 21:20:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:31,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543369612] [2022-10-15 21:20:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:20:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 21:20:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-15 21:20:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 21:20:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:20:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:20:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-10-15 21:20:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:20:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:20:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:20:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:20:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:20:31,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543369612] [2022-10-15 21:20:31,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543369612] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:20:31,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:20:31,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:20:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670131824] [2022-10-15 21:20:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:20:31,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:20:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:20:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:20:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:20:31,205 INFO L87 Difference]: Start difference. First operand 3743 states and 5192 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-15 21:20:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:20:32,096 INFO L93 Difference]: Finished difference Result 4449 states and 6309 transitions. [2022-10-15 21:20:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:20:32,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2022-10-15 21:20:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:20:32,117 INFO L225 Difference]: With dead ends: 4449 [2022-10-15 21:20:32,117 INFO L226 Difference]: Without dead ends: 4447 [2022-10-15 21:20:32,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:20:32,121 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 174 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:20:32,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1304 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:20:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2022-10-15 21:20:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 3779. [2022-10-15 21:20:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3011 states have (on average 1.4214546662238459) internal successors, (4280), 3126 states have internal predecessors, (4280), 484 states have call successors, (484), 254 states have call predecessors, (484), 252 states have return successors, (482), 436 states have call predecessors, (482), 482 states have call successors, (482) [2022-10-15 21:20:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 5246 transitions. [2022-10-15 21:20:32,532 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 5246 transitions. Word has length 81 [2022-10-15 21:20:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:20:32,532 INFO L495 AbstractCegarLoop]: Abstraction has 3779 states and 5246 transitions. [2022-10-15 21:20:32,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-15 21:20:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 5246 transitions. [2022-10-15 21:20:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-15 21:20:32,534 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:20:32,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:20:32,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 21:20:32,535 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting lock_torture_stats_printErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2022-10-15 21:20:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:20:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash -23297391, now seen corresponding path program 1 times [2022-10-15 21:20:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:20:32,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141738206] [2022-10-15 21:20:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:20:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:20:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:20:32,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 21:20:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:20:32,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 21:20:32,761 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 21:20:32,762 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location lock_torture_stats_printErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 42 remaining) [2022-10-15 21:20:32,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_lock_busted_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 42 remaining) [2022-10-15 21:20:32,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_lock_busted_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 42 remaining) [2022-10-15 21:20:32,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 42 remaining) [2022-10-15 21:20:32,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 42 remaining) [2022-10-15 21:20:32,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 42 remaining) [2022-10-15 21:20:32,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 42 remaining) [2022-10-15 21:20:32,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 42 remaining) [2022-10-15 21:20:32,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 42 remaining) [2022-10-15 21:20:32,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 42 remaining) [2022-10-15 21:20:32,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 42 remaining) [2022-10-15 21:20:32,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_stats_printErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 42 remaining) [2022-10-15 21:20:32,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_spin_lock_write_delayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 42 remaining) [2022-10-15 21:20:32,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_spin_lock_write_delayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 42 remaining) [2022-10-15 21:20:32,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_spin_lock_write_delayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 42 remaining) [2022-10-15 21:20:32,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location torture_spin_lock_write_delayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 42 remaining) [2022-10-15 21:20:32,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_cleanupErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 42 remaining) [2022-10-15 21:20:32,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lock_torture_cleanupErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 42 remaining) [2022-10-15 21:20:32,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 42 remaining) [2022-10-15 21:20:32,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 42 remaining) [2022-10-15 21:20:32,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 42 remaining) [2022-10-15 21:20:32,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 42 remaining) [2022-10-15 21:20:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 42 remaining) [2022-10-15 21:20:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 42 remaining) [2022-10-15 21:20:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 42 remaining) [2022-10-15 21:20:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 42 remaining) [2022-10-15 21:20:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 42 remaining) [2022-10-15 21:20:32,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 42 remaining) [2022-10-15 21:20:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 42 remaining) [2022-10-15 21:20:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 42 remaining) [2022-10-15 21:20:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 42 remaining) [2022-10-15 21:20:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 42 remaining) [2022-10-15 21:20:32,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 42 remaining) [2022-10-15 21:20:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 42 remaining) [2022-10-15 21:20:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 42 remaining) [2022-10-15 21:20:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 42 remaining) [2022-10-15 21:20:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 42 remaining) [2022-10-15 21:20:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 42 remaining) [2022-10-15 21:20:32,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 42 remaining) [2022-10-15 21:20:32,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 42 remaining) [2022-10-15 21:20:32,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 42 remaining) [2022-10-15 21:20:32,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 42 remaining) [2022-10-15 21:20:32,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 21:20:32,778 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:20:32,783 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:20:32,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:20:32 BoogieIcfgContainer [2022-10-15 21:20:32,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:20:32,988 INFO L158 Benchmark]: Toolchain (without parser) took 30149.63ms. Allocated memory was 163.6MB in the beginning and 728.8MB in the end (delta: 565.2MB). Free memory was 135.1MB in the beginning and 462.8MB in the end (delta: -327.7MB). Peak memory consumption was 238.8MB. Max. memory is 8.0GB. [2022-10-15 21:20:32,988 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:20:32,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1376.77ms. Allocated memory is still 163.6MB. Free memory was 134.9MB in the beginning and 121.8MB in the end (delta: 13.1MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. [2022-10-15 21:20:32,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 134.45ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 116.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-15 21:20:32,991 INFO L158 Benchmark]: Boogie Preprocessor took 162.05ms. Allocated memory is still 163.6MB. Free memory was 116.0MB in the beginning and 110.3MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-15 21:20:32,992 INFO L158 Benchmark]: RCFGBuilder took 1854.92ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 110.3MB in the beginning and 161.2MB in the end (delta: -51.0MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2022-10-15 21:20:32,992 INFO L158 Benchmark]: TraceAbstraction took 26602.10ms. Allocated memory was 203.4MB in the beginning and 728.8MB in the end (delta: 525.3MB). Free memory was 160.2MB in the beginning and 462.8MB in the end (delta: -302.6MB). Peak memory consumption was 222.7MB. Max. memory is 8.0GB. [2022-10-15 21:20:32,997 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1376.77ms. Allocated memory is still 163.6MB. Free memory was 134.9MB in the beginning and 121.8MB in the end (delta: 13.1MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 134.45ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 116.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 162.05ms. Allocated memory is still 163.6MB. Free memory was 116.0MB in the beginning and 110.3MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1854.92ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 110.3MB in the beginning and 161.2MB in the end (delta: -51.0MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. * TraceAbstraction took 26602.10ms. Allocated memory was 203.4MB in the beginning and 728.8MB in the end (delta: 525.3MB). Free memory was 160.2MB in the beginning and 462.8MB in the end (delta: -302.6MB). Peak memory consumption was 222.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 2320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of strcmp at line 2444, overapproximation of large string literal at line 2071, overapproximation of bitwiseAnd at line 2892. Possible FailurePath: [L2036] int ldv_state_variable_3 ; [L2037] int ldv_state_variable_1 ; [L2038] int LDV_IN_INTERRUPT = 1; [L2039] int ldv_state_variable_2 ; [L2040] int ref_cnt ; [L2041] int ldv_state_variable_0 ; [L2063] static int nwriters_stress = -1; [L2064] static int onoff_holdoff = 0; [L2065] static int onoff_interval = 0; [L2066] static int shuffle_interval = 3; [L2067] static int shutdown_secs = 0; [L2068] static int stat_interval = 60; [L2069] static int stutter = 5; [L2070] static bool verbose = 1; [L2071] static char *torture_type = (char *)"spin_lock"; [L2072] static atomic_t n_lock_torture_errors ; [L2073] static struct task_struct *stats_task ; [L2074] static struct task_struct **writer_tasks ; [L2075] static int nrealwriters_stress ; [L2076] static bool lock_is_write_held ; [L2077] static struct lock_writer_stress_stats *lwsa ; [L2078] int locktorture_runnable = 1; [L2080] static struct lock_torture_ops *cur_ops ; [L2119-L2120] static struct lock_torture_ops lock_busted_ops = {0, & torture_lock_busted_write_lock, & torture_lock_busted_write_delay, & torture_lock_busted_write_unlock, 0UL, "lock_busted"}; [L2121-L2122] static spinlock_t torture_spinlock = {{{{{0U}}, 3735899821U, 4294967295U, (void *)-1, {0, {0, 0}, "torture_spinlock", 0, 0UL}}}}; [L2171-L2172] static struct lock_torture_ops spin_lock_ops = {0, & torture_spin_lock_write_lock, & torture_spin_lock_write_delay, & torture_spin_lock_write_unlock, 0UL, "spin_lock"}; [L2189-L2190] static struct lock_torture_ops spin_lock_irq_ops = {0, & torture_spin_lock_write_lock_irq, & torture_spin_lock_write_delay, & torture_lock_spin_write_unlock_irq, 0UL, "spin_lock_irq"}; [L2587] int ldv_retval_0 ; [L2888] int ldv_spin = 0; VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2598] struct torture_random_state *ldvarg0 ; [L2599] void *tmp ; [L2600] struct torture_random_state *ldvarg1 ; [L2601] void *tmp___0 ; [L2602] struct torture_random_state *ldvarg2 ; [L2603] void *tmp___1 ; [L2604] int tmp___2 ; [L2605] int tmp___3 ; [L2606] int tmp___4 ; [L2607] int tmp___5 ; [L2608] int tmp___6 ; VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2610] CALL, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1978] void *p ; [L1979] void *tmp ; [L1980] int tmp___0 ; [L1982] tmp___0 = __VERIFIER_nondet_int() [L1983] COND TRUE tmp___0 != 0 [L1984] return ((void *)0); VAL [\old(size)=16, \result={0:0}, cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=16, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2610] RET, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(16UL)={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2610] tmp = ldv_zalloc(16UL) [L2611] ldvarg0 = (struct torture_random_state *)tmp VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2612] CALL, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1978] void *p ; [L1979] void *tmp ; [L1980] int tmp___0 ; [L1982] tmp___0 = __VERIFIER_nondet_int() [L1983] COND TRUE tmp___0 != 0 [L1984] return ((void *)0); VAL [\old(size)=16, \result={0:0}, cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=16, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2612] RET, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(16UL)={0:0}, ldvarg0={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2612] tmp___0 = ldv_zalloc(16UL) [L2613] ldvarg1 = (struct torture_random_state *)tmp___0 VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2614] CALL, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1978] void *p ; [L1979] void *tmp ; [L1980] int tmp___0 ; [L1982] tmp___0 = __VERIFIER_nondet_int() [L1983] COND TRUE tmp___0 != 0 [L1984] return ((void *)0); VAL [\old(size)=16, \result={0:0}, cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=16, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2614] RET, EXPR ldv_zalloc(16UL) VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(16UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2614] tmp___1 = ldv_zalloc(16UL) [L2615] ldvarg2 = (struct torture_random_state *)tmp___1 [L2616] FCALL ldv_initialize() [L2617] ldv_state_variable_1 = 0 [L2618] ref_cnt = 0 [L2619] ldv_state_variable_0 = 1 [L2620] ldv_state_variable_3 = 0 [L2621] ldv_state_variable_2 = 0 VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2623] tmp___2 = __VERIFIER_nondet_int() [L2625] case 0: [L2683] case 1: VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2684] COND TRUE ldv_state_variable_0 != 0 [L2685] tmp___4 = __VERIFIER_nondet_int() [L2687] case 0: [L2695] case 1: VAL [cur_ops={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=1, tmp___4=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2696] COND TRUE ldv_state_variable_0 == 1 [L2697] CALL lock_torture_init() [L2416] int i ; [L2417] int firsterr ; [L2418] struct lock_torture_ops *torture_ops[3U] ; [L2419] bool tmp ; [L2420] int tmp___0 ; [L2421] int tmp___1 ; [L2422] unsigned int tmp___2 ; [L2423] void *tmp___3 ; [L2424] void *tmp___4 ; [L2426] firsterr = 0 [L2427] torture_ops[0] = & lock_busted_ops [L2428] torture_ops[1] = & spin_lock_ops [L2429] torture_ops[2] = & spin_lock_irq_ops [L2430] CALL, EXPR torture_init_begin(torture_type, (int )verbose, & locktorture_runnable) [L3035] return __VERIFIER_nondet_bool(); [L2430] RET, EXPR torture_init_begin(torture_type, (int )verbose, & locktorture_runnable) [L2430] tmp = torture_init_begin(torture_type, (int )verbose, & locktorture_runnable) [L2431] COND TRUE \read(tmp) [L2432] tmp___0 = 0 VAL [cur_ops={0:0}, firsterr=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2436] COND FALSE !(\read(tmp___0)) [L2440] i = 0 VAL [cur_ops={0:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2451] COND TRUE (unsigned int )i <= 2U VAL [cur_ops={0:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2443] EXPR torture_ops[i] [L2443] cur_ops = torture_ops[i] [L2444] EXPR cur_ops->name [L2444] tmp___1 = strcmp((char const *)torture_type, cur_ops->name) [L2445] COND TRUE tmp___1 == 0 VAL [cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2456] COND FALSE !(i == 3) [L2474] EXPR cur_ops->init VAL [cur_ops={50:0}, cur_ops->init={0:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2474] COND FALSE !((unsigned long )cur_ops->init != (unsigned long )((void (*)(void))0)) [L2478] COND FALSE !(nwriters_stress >= 0) [L2481] CALL, EXPR cpumask_weight(cpu_online_mask) [L1887] int tmp ; [L1889] CALL, EXPR bitmap_weight((unsigned long const *)(& srcp->bits), nr_cpu_ids) [L1877] int tmp___0 ; [L1879] CALL, EXPR __bitmap_weight(src, nbits) [L2951] return __VERIFIER_nondet_int(); [L1879] RET, EXPR __bitmap_weight(src, nbits) [L1879] tmp___0 = __bitmap_weight(src, nbits) [L1880] return (tmp___0); VAL [\old(nbits)=34359738340, \result=-1073741825, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nbits=34359738340, nr_cpu_ids=34359738340, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, src={34359738339:34359738342}, src={34359738339:34359738342}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=-1073741825, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1889] RET, EXPR bitmap_weight((unsigned long const *)(& srcp->bits), nr_cpu_ids) [L1889] tmp = bitmap_weight((unsigned long const *)(& srcp->bits), nr_cpu_ids) [L1890] return ((unsigned int )tmp); VAL [\result=-1073741825, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=0, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, srcp={34359738339:34359738342}, srcp={34359738339:34359738342}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=-1073741825, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2481] RET, EXPR cpumask_weight(cpu_online_mask) [L2481] tmp___2 = cpumask_weight(cpu_online_mask) [L2482] nrealwriters_stress = (int )(tmp___2 * 2U) VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2484] CALL lock_torture_print_module_parms(cur_ops, "Start of test") VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, cur_ops___0={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tag={36:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2484] RET lock_torture_print_module_parms(cur_ops, "Start of test") VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2485] lock_is_write_held = 0 VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2486] CALL, EXPR kmalloc((unsigned long )nrealwriters_stress * 16UL, 208U) VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2874] CALL ldv_check_alloc_flags(flags) VAL [\old(flags)=208, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2892] COND TRUE ldv_spin == 0 || ! (flags & 16U) VAL [\old(flags)=208, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2874] RET ldv_check_alloc_flags(flags) VAL [\old(flags)=208, \old(size)=4294967264, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2875] CALL ldv_kmalloc_12(size, flags) [L1942] void *tmp___2 ; [L1944] CALL, EXPR __kmalloc(size, flags) [L1937] CALL, EXPR ldv_malloc(size) VAL [\old(size)=4294967264, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1961] void *p ; [L1962] void *tmp ; [L1963] int tmp___0 ; [L1965] tmp___0 = __VERIFIER_nondet_int() [L1966] COND TRUE tmp___0 != 0 [L1967] return ((void *)0); VAL [\old(size)=4294967264, \result={0:0}, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___0=1, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1937] RET, EXPR ldv_malloc(size) VAL [\old(size)=4294967264, \old(t)=208, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={0:0}, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, t=208, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L1937] return ldv_malloc(size); [L1944] RET, EXPR __kmalloc(size, flags) [L1944] tmp___2 = __kmalloc(size, flags) [L1945] return (tmp___2); VAL [\old(flags)=208, \old(size)=4294967264, \result={0:0}, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp___2={0:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2875] RET ldv_kmalloc_12(size, flags) [L2876] return ((void *)0); VAL [\old(flags)=208, \old(size)=4294967264, \result={0:0}, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, size=4294967264, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2486] RET, EXPR kmalloc((unsigned long )nrealwriters_stress * 16UL, 208U) VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, kmalloc((unsigned long )nrealwriters_stress * 16UL, 208U)={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2486] tmp___3 = kmalloc((unsigned long )nrealwriters_stress * 16UL, 208U) [L2487] lwsa = (struct lock_writer_stress_stats *)tmp___3 VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, tmp___3={0:0}, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2488] COND TRUE (unsigned long )lwsa == (unsigned long )((struct lock_writer_stress_stats *)0) VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=0, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, tmp___3={0:0}, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2489] COND TRUE (int )verbose [L2493] firsterr = -12 VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=-12, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, tmp___3={0:0}, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2582] FCALL torture_init_end() VAL [cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, firsterr=-12, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=1, tmp___0=0, tmp___1=0, tmp___2=3221225471, tmp___3={0:0}, torture_ops={54:0}, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2583] CALL lock_torture_cleanup() VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2373] int i ; [L2374] bool tmp ; [L2375] bool tmp___0 ; [L2376] int tmp___1 ; [L2378] CALL, EXPR torture_cleanup() [L3031] return __VERIFIER_nondet_bool(); [L2378] RET, EXPR torture_cleanup() [L2378] tmp = torture_cleanup() [L2379] COND FALSE !((int )tmp) VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=0, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2383] COND FALSE !((unsigned long )writer_tasks != (unsigned long )((struct task_struct **)0)) VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=0, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2398] FCALL _torture_stop_kthread((char *)"Stopping lock_torture_stats task", & stats_task) VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, tmp=0, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2399] CALL lock_torture_stats_print() VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2316] int size ; [L2317] char *buf ; [L2318] void *tmp ; VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] [L2320] nrealwriters_stress * 200 VAL [\old(writer_tasks)=0, \old(writer_tasks)=0, cpu_online_mask={34359738339:34359738342}, cur_ops={50:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_spin=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, lock_busted_ops={50:0}, lock_is_write_held=0, locktorture_runnable={49:0}, lwsa={0:0}, n_lock_torture_errors={47:0}, nr_cpu_ids=34359738340, nrealwriters_stress=2147483646, nwriters_stress=-1, onoff_holdoff=0, onoff_interval=0, ref_cnt=0, shuffle_interval=3, shutdown_secs=0, spin_lock_irq_ops={53:0}, spin_lock_ops={52:0}, stat_interval=60, stats_task={48:0}, stutter=5, torture_spinlock={51:0}, torture_type={3:0}, verbose=1, writer_tasks={0:0}] - UnprovableResult [Line: 2096]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2096]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2286]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2286]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2157]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2157]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2388]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2388]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2664]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2664]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2672]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2672]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2449]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2449]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2463]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2463]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2502]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2502]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2509]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2509]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2509]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2509]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2825]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2825]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 429 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9351 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8696 mSDsluCounter, 21164 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11721 mSDsCounter, 1836 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7185 IncrementalHoareTripleChecker+Invalid, 9021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1836 mSolverCounterUnsat, 9443 mSDtfsCounter, 7185 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3779occurred in iteration=15, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 17941 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 919 NumberOfCodeBlocks, 919 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 1802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1367 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 225/242 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 21:20:33,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...